{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:18:42Z","timestamp":1743023922242,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214608"},{"type":"electronic","value":"9783642214615"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21461-5_6","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:25:36Z","timestamp":1307712336000},"page":"90-105","source":"Crossref","is-referenced-by-count":2,"title":["Adaptable Processes (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Mario","family":"Bravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cinzia","family":"Di Giusto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-02930-1_3","volume-title":"Automata, Languages and Programming","author":"L. Acciai","year":"2009","unstructured":"Acciai, L., Boreale, M.: Deciding safety properties in infinite-state pi-calculus via behavioural types. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 31\u201342. Springer, Heidelberg (2009)"},{"key":"6_CR3","unstructured":"Baeten, J., Bergstra, J.: Mode transfer in process algebra. Technical Report Report 00\/01, Eindhoven University of Technology (2000)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Berger, M., Honda, K.: The two-phase commitment protocol in an extended pi-calculus. Electr. Notes Theor. Comput. Sci.\u00a039(1) (2000)","DOI":"10.1016\/S1571-0661(05)82502-2"},{"key":"6_CR5","unstructured":"Bravetti, M., Di Giusto, C., P\u00e9rez, J.A., Zavattaro, G.: Adaptable processes. Technical report, Univ. of Bologna, (2011), Draft, http:\/\/www.cs.unibo.it\/~perez\/ap\/"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bravetti, M., Di Giusto, C., P\u00e9rez, J.A., Zavattaro, G.: Steps on the Road to Component Evolvability. Post-proceedings of FACS 2010. LNCS. Springer, Heidelberg (to appear, 2011)","DOI":"10.1007\/978-3-642-27269-1_19"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1017\/S0960129509007683","volume":"19","author":"M. Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: On the expressive power of process interruption and compensation. Math. Struct. in Comp. Sci.\u00a019(3), 565\u2013599 (2009)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"6_CR8","unstructured":"Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: Bisimulation congruences for homer \u2014 a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S096012950999017X","volume":"19","author":"N. Busi","year":"2009","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. Math. Struct. in Comp. Sci.\u00a019(6), 1191\u20131222 (2009)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G. Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"6_CR11","unstructured":"Esparza, J.: Some applications of petri nets to the analysis of parameterised systems. Talk at WISP 2003 (2003)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: Proc. of LICS, pp. 352\u2013359 (1999)","DOI":"10.1109\/LICS.1999.782630"},{"issue":"1-2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-71316-6_27","volume-title":"Programming Languages and Systems","author":"A. Francalanza","year":"2007","unstructured":"Francalanza, A., Hennessy, M.: A fault tolerance bisimulation proof for consensus (Extended abstract). In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 395\u2013410. Springer, Heidelberg (2007)"},{"issue":"2","key":"6_CR15","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and vazsonyi\u2019s conjecture. Transactions of the American Mathematical Society\u00a095(2), 210\u2013225 (1960)","journal-title":"Transactions of the American Mathematical Society"},{"key":"6_CR16","volume-title":"Comunication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Comunication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"6_CR17","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-45187-7_26","volume-title":"CONCUR 2003 - Concurrency Theory","author":"U. Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R., Merro, M.: Modeling consensus in a process calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 399\u2013414. Springer, Heidelberg (2003)"},{"key":"6_CR19","unstructured":"P\u00e9rez, J.A.: Higher-Order Concurrency: Expressiveness and Decidability Results. PhD thesis, University of Bologna (2010), Draft, http:\/\/www.japerez.phipages.com"},{"issue":"1-2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/S0304-3975(00)00326-1","volume":"266","author":"J. Riely","year":"2001","unstructured":"Riely, J., Hennessy, M.: Distributed processes and location failures. Theor. Comput. Sci.\u00a0266(1-2), 693\u2013735 (2001); An extended abstract appeared in Proc. of ICALP 1997","journal-title":"Theor. Comput. Sci."},{"key":"6_CR21","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST\u201399\u201393, University of Edinburgh, Dept. of Comp. Sci. (1992)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-31794-4_9","volume-title":"Global Computing","author":"A. Schmitt","year":"2005","unstructured":"Schmitt, A., Stefani, J.-B.: The kell calculus: A family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol.\u00a03267, pp. 146\u2013178. Springer, Heidelberg (2005)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 94\u2013108. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21461-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T02:48:58Z","timestamp":1741229338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21461-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214608","9783642214615"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21461-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}