{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:49:30Z","timestamp":1767340170613},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_4","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T15:59:29Z","timestamp":1154534369000},"page":"52-63","source":"Crossref","is-referenced-by-count":12,"title":["Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Nestmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"104","volume-title":"Proceedings of POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: Proceedings of POPL 2001, pp. 104\u2013115. ACM Press, New York (2001)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-39993-3_4","volume-title":"From Object-Orientation to Formal Methods","author":"G.A. Agha","year":"2004","unstructured":"Agha, G.A., Thati, P.: An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol.\u00a02635, pp. 26\u201357. Springer, Heidelberg (2004)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-28644-8_8","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. Berger","year":"2004","unstructured":"Berger, M.: Basic Theory of Reduction Congruence for Two Timed Asynchronous \u03c0-Calculi. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 115\u2013130. Springer, Heidelberg (2004)"},{"unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus (Note). Rapport de Recherche 1702, INRIA Sophia-Antipolis (May 1992)","key":"4_CR5"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-45510-8_11","volume-title":"Modeling and Verification of Parallel Processes","author":"S. Dal-Zilio","year":"2001","unstructured":"Dal-Zilio, S.: Mobile Processes: A Commented Bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 206\u2013222. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V. Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal Molecular Biology. Theoretical Computer Science\u00a0325(1), 69\u2013110 (2004)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Engberg, U., Nielsen, M.: A Calculus of Communicating Systems with Label-passing. Technical Report DAIMI PB-208, Computer Science Department, University of Aarhus, Denmark (1986)","key":"4_CR9","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/237721.237805","volume-title":"Proceedings of POPL 1996","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G.: The Reflexive Chemical Abstract Machine and the Join-Calculus. In: Proceedings of POPL 1996, pp. 372\u2013385. ACM Press, New York (1996)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2004","unstructured":"Fournet, C., Gonthier, G.: A Hierarchy of Equivalences for Asynchronous Calculi. Journal of Logic and Algebraic Programming\u00a063(1), 131\u2013173 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R. Glabbeek","year":"1993","unstructured":"Glabbeek, R.: The Linear Time \u2013 Branching Time Spectrum II: The semantics of sequential systems with silent moves (Extended Abstract). In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-45608-2_5","volume-title":"Foundations of Security Analysis and Design","author":"A.D. Gordon","year":"2001","unstructured":"Gordon, A.D.: Notes on Nominal Calculi for Security and Mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.\u00a02171, pp. 262\u2013330. Springer, Heidelberg (2001)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-46432-8_10","volume-title":"Foundation of Software Science and Computation Structures","author":"O.M. Herescu","year":"2000","unstructured":"Herescu, O.M., Palamidessi, C.: Probabilistic Asynchronous \u03c0-Calculus. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 146\u2013160. Springer, Heidelberg (2000)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55613-3_2","volume-title":"Object-Based Concurrent Computing","author":"K. Honda","year":"1992","unstructured":"Honda, K., Tokoro, M.: On Asynchronous Communication Semantics. In: Tokoro, M., Wegner, P., Nierstrasz, O. (eds.) ECOOP-WS 1991. LNCS, vol.\u00a0612, pp. 21\u201351. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: On Reduction-Based Process Semantics. Theoretical Computer Science 152(2) 437???486 (1995);","key":"#cr-split#-4_CR16.1","DOI":"10.1016\/0304-3975(95)00074-7"},{"unstructured":"In: Shyamasundar, R.K. (ed.) Proceedings of FSTTCS 1993. LNCS, vol.??761, pp. 437???486. Springer, Heidelberg (1993) (extract appeared)","key":"#cr-split#-4_CR16.2"},{"unstructured":"Ing\u00f3lfsd\u00f3ttir, A.: Semantic Models for Communicating Processes with Value-Passing. PhD thesis, University of Sussex (1994)","key":"4_CR17"},{"key":"4_CR18","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I\/II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed Bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1017\/S0960129504004323","volume":"14","author":"M. Merro","year":"2004","unstructured":"Merro, M., Sangiorgi, D.: On Asynchrony in Name-Passing Calculi. Mathematical Structures in Computer Science\u00a014(5), 715\u2013767 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"unstructured":"Nestmann, U.: Calculi for Mobile Processes, http:\/\/move.to\/mobility","key":"4_CR22"},{"key":"4_CR23","first-page":"139","volume":"64","author":"U. Nestmann","year":"1998","unstructured":"Nestmann, U., Victor, B.: Calculi for Mobile Processes: Bibliography and Web Pages. EATCS Bulletin\u00a064, 139\u2013144 (1998)","journal-title":"EATCS Bulletin"},{"issue":"5","key":"4_CR24","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous \u03c0-calculus. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/B978-044482830-9\/50026-6","volume-title":"Handbook of Process Algebra","author":"J. Parrow","year":"2001","unstructured":"Parrow, J.: An Introduction to the pi-Calculus. In: Handbook of Process Algebra, pp. 479\u2013543. Elsevier, Amsterdam (2001)"},{"key":"4_CR26","first-page":"2190","volume-title":"Handbook of Computer Science and Engineering","author":"B.C. Pierce","year":"1997","unstructured":"Pierce, B.C.: Foundational Calculi for Programming Languages. In: Handbook of Computer Science and Engineering, pp. 2190\u20132207. CRC Press, Boca Raton (1997)"},{"issue":"6","key":"4_CR27","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","volume":"38","author":"C. Priami","year":"1995","unstructured":"Priami, C.: Stochastic \u03c0-Calculus. The Computer Journal\u00a038(6), 578\u2013589 (1995); Proceedings of PAPM 1995","journal-title":"The Computer Journal"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(01)00214-9","volume":"80","author":"C. Priami","year":"2001","unstructured":"Priami, C., Regev, A., Shapiro, E.Y., Silverman, W.: Application of a Stochastic Name-Passing Calculus to Representation and Simulation of Molecular Processes. Information Processing Letters\u00a080(1), 25\u201331 (2001)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science??6(5), 409???454 (1996);","key":"#cr-split#-4_CR29.1","DOI":"10.1017\/S096012950007002X"},{"unstructured":"In: Proceedings of LICS 1993, pp. 376???385 (1993) (extract appeared)","key":"#cr-split#-4_CR29.2"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11538394_11","volume-title":"Business Process Management","author":"M. Weske","year":"2005","unstructured":"Weske, M., Puhlmann, F.: Using the \u03c0-Calculus for Formalizing Workflow Patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol.\u00a03649, pp. 153\u2013168. Springer, Heidelberg (2005)"},{"key":"4_CR31","volume-title":"Proceedings of POPL 1998","author":"J. Riely","year":"1998","unstructured":"Riely, J., Hennessy, M.: A Typed Language for Distributed Mobile Processes. In: Proceedings of POPL 1998. ACM Press, New York (1998)"},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(00)00097-9","volume":"253","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D.: Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial). Theoretical Computer Science\u00a0253(2), 311\u2013350 (2001)","journal-title":"Theoretical Computer Science"},{"unstructured":"Sewell, P.: Applied Pi \u2014 A Brief Tutorial. Technical Report 498, Computer Laboratory, University of Cambridge (2000)","key":"4_CR33"},{"key":"4_CR34","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"doi-asserted-by":"crossref","unstructured":"Unyapoth, A.: Nomadic Pi Calculi: Expressing and Verifying Infrastructure for Mobile Computation. PhD thesis, University of Cambridge (June 2001)","key":"4_CR35","DOI":"10.1145\/373243.360214"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/BFb0052178","volume-title":"Object-Oriented Programming","author":"V.T. Vasconcelos","year":"1994","unstructured":"Vasconcelos, V.T.: Typed Concurrent Objects. In: Tokoro, M., Pareschi, R. (eds.) ECOOP 1994. LNCS, vol.\u00a0821, pp. 100\u2013117. Springer, Heidelberg (1994)"},{"issue":"2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/4434.846193","volume":"8","author":"P. Wojciechowski","year":"2000","unstructured":"Wojciechowski, P., Sewell, P.: Nomadic Pict: Language and Infrastructure Design for Mobile Agents. IEEE Concurrency\u00a08(2), 42\u201352 (2000)","journal-title":"IEEE Concurrency"},{"issue":"1\u20132","key":"4_CR38","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(00)00310-8","volume":"274","author":"N. Yoshida","year":"2002","unstructured":"Yoshida, N.: Minimality and separation results on asynchronous mobile processes \u2014 Representability theorems by concurrent combinators. Theoretical Computer Science\u00a0274(1\u20132), 231\u2013276 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:15:52Z","timestamp":1605626152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/11817949_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}