{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:49:56Z","timestamp":1778914196610,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s00446-010-0120-6","type":"journal-article","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T10:54:04Z","timestamp":1288004044000},"page":"273-299","source":"Crossref","is-referenced-by-count":18,"title":["A taxonomy of process calculi for distribution and mobility"],"prefix":"10.1007","volume":"23","author":[{"given":"Daniele","family":"Gorla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"issue":"1","key":"120_CR1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0304-3975(99)00230-3","volume":"240","author":"R. Amadio","year":"2000","unstructured":"Amadio R.: On modelling mobility. Theor. Comput. Sci. 240(1), 147\u2013176 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"120_CR2","doi-asserted-by":"crossref","unstructured":"Baldamus, M., Parrow, J., Victor, B.: Spi-calculus translated to pi-calculus preserving may-tests. In: Proceedings of LICS. pp. 22\u201331. IEEE Computer Society (2004)","DOI":"10.1109\/LICS.2004.1319597"},{"key":"120_CR3","doi-asserted-by":"crossref","unstructured":"Baldamus, M., Parrow, J., Victor, B.: A fully abstract encoding of the i-calculus with data terms. In: Proceedings of ICALP. LNCS, vol. 3580, pp. 1202\u20131213. Springer (2005)","DOI":"10.1007\/11523468_97"},{"key":"120_CR4","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May (1992)"},{"issue":"1","key":"120_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/963778.963781","volume":"26","author":"M. Bugliesi","year":"2004","unstructured":"Bugliesi M., Castagna G., Crafa S.: Access control for mobile agents: the calculus of boxed ambients. ACM Trans. Program. Lang. Syst. 26(1), 57\u2013124 (2004)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"120_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ic.2005.06.002","volume":"202","author":"M. Bugliesi","year":"2005","unstructured":"Bugliesi M., Crafa S., Merro M., Sassone V.: Communication and mobility control in boxed ambients. Inf. Comput. 202(1), 39\u201386 (2005)","journal-title":"Inf. Comput."},{"key":"120_CR7","doi-asserted-by":"crossref","unstructured":"Bugliesi, M., Giunti, M.: Secure implementations of typed channel abstractions. In: Proceedings of POPL. pp. 251\u2013262. ACM (2007)","DOI":"10.1145\/1190215.1190253"},{"issue":"3","key":"120_CR8","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.tcs.2003.10.040","volume":"322","author":"N. Busi","year":"2004","unstructured":"Busi N., Zavattaro G.: On the expressive power of movement and restriction in pure mobile ambients. Theor. Comput. Sci. 322(3), 477\u2013515 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"120_CR9","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone M., Maffeis S.: On the expressive power of polyadic synchronisation in \u03c0-calculus. Nordic J. Comput. 10(2), 70\u201398 (2003)","journal-title":"Nordic J. Comput."},{"key":"120_CR10","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Abstractions for mobile computation. In: Secure Internet Programming. LNCS, vol. 1603, pp. 51\u201394. Springer (1999)","DOI":"10.1007\/3-540-48749-2_4"},{"key":"120_CR11","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Mobility types for mobile ambients. In: Proceedings of ICALP. LNCS, vol. 1644, pp. 230\u2013239. Springer (1999)","DOI":"10.1007\/3-540-48523-6_20"},{"key":"120_CR12","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.D.: Types for mobile ambients. In: Proceedings of POPL. pp. 79\u201392. ACM (1999)","DOI":"10.1145\/292540.292550"},{"issue":"1","key":"120_CR13","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 240(1), 177\u2013213 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"120_CR14","doi-asserted-by":"crossref","unstructured":"Dal Zilio, S.: Mobile processes: a commented bibliography. In: Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes. LNCS, vol. 2067, pp. 206\u2013222. Springer (2001)","DOI":"10.1007\/3-540-45510-8_11"},{"issue":"3","key":"120_CR15","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.tcs.2006.02.007","volume":"356","author":"R. De Nicola","year":"2006","unstructured":"De Nicola R., Gorla D., Pugliese R.: On the Expressive Power of KLAIM-based Calculi. Theor. Comput. Sci. 356(3), 387\u2013421 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"120_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. De Nicola","year":"1984","unstructured":"De Nicola R., Hennessy M.: Testing equivalence for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"120_CR17","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G., L\u00e9vy, J.J., Maranget, L. & R\u00e9my, D.: A calculus of mobile agents. In: Proceedings of CONCUR. LNCS, vol. 1119, pp. 406\u2013421. Springer (1996)","DOI":"10.1007\/3-540-61604-7_67"},{"key":"120_CR18","doi-asserted-by":"crossref","unstructured":"Fournet, C., L\u00e9vy, J.-J., Schmitt, A.: An asynchronous, distributed implementation of mobile ambients. In: Proceedings of IFIP TCS. LNCS, vol. 1872, pp. 348\u2013364. Springer (2000)","DOI":"10.1007\/3-540-44929-9_26"},{"issue":"3","key":"120_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.scico.2005.05.002","volume":"59","author":"P. Giannini","year":"2006","unstructured":"Giannini P., Sangiorgi D., Valente A.: Safe ambients: abstract machine and distributed implementation. Sci. Comput. Program. 59(3), 209\u2013249 (2006)","journal-title":"Sci. Comput. Program."},{"issue":"8","key":"120_CR20","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.ic.2008.05.001","volume":"206","author":"D. Gorla","year":"2008","unstructured":"Gorla D.: Comparing communication primitives via their relative expressive power. Inf. Comput. 206(8), 931\u2013952 (2008)","journal-title":"Inf. Comput."},{"key":"120_CR21","doi-asserted-by":"crossref","unstructured":"Gorla, D.: On the relative expressive power of ambient-based calculi. In: Proceedings of TGC\u201908. LNCS, vol. 5474, pp. 141\u2013156. Springer (2009)","DOI":"10.1007\/978-3-642-00945-7_9"},{"key":"120_CR22","doi-asserted-by":"crossref","unstructured":"Gorla, D.: On the relative expressive power of calculi for mobility. In: Proceedings of MFPS. ENTCS vol. 249, pp. 269\u2013286. Elsevier, Amsterdam (2009)","DOI":"10.1016\/j.entcs.2009.07.094"},{"issue":"9","key":"120_CR23","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D. Gorla","year":"2010","unstructured":"Gorla D.: Towards a unified approach to encodability and separation results. Inf. Comput. 208(9), 1031\u20131053 (2010) (An extended abstract appeared in the Proc. of CONCUR\u201908)","journal-title":"Inf. Comput."},{"key":"120_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611063","volume-title":"A Distributed Pi-calculus","author":"M. Hennessy","year":"2007","unstructured":"Hennessy M.: A Distributed Pi-calculus. Cambridge University Press, Cambridge (2007)"},{"issue":"3","key":"120_CR25","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.tcs.2003.12.024","volume":"322","author":"M. Hennessy","year":"2004","unstructured":"Hennessy M., Merro M., Rathke J.: Towards a behavioural theory of access and mobility control in distributed systems. Theor. Comput. Sci. 322(3), 615\u2013669 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"120_CR26","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1006\/inco.2001.3089","volume":"173","author":"M. Hennessy","year":"2002","unstructured":"Hennessy M., Riely J.: Resource access control in systems of mobile agents. Inf. Comput. 173, 82\u2013120 (2002)","journal-title":"Inf. Comput."},{"key":"120_CR27","doi-asserted-by":"crossref","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: Proceedings of ECOOP. LNCS, vol. 512, pp. 133\u2013147. Springer, Heidelberg (1991)","DOI":"10.1007\/BFb0057019"},{"key":"120_CR28","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. In: Proceedings of POPL, pp. 128\u2013141. ACM (2001)","DOI":"10.1145\/360204.360215"},{"issue":"6","key":"120_CR29","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00236-005-0002-8","volume":"42","author":"F. Levi","year":"2006","unstructured":"Levi F.: A typed encoding of boxed into Safe Ambients. Acta Inform. 42(6), 429\u2013500 (2006)","journal-title":"Acta Inform."},{"issue":"1","key":"120_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/596980.596981","volume":"25","author":"F. Levi","year":"2003","unstructured":"Levi F., Sangiorgi D.: Mobile Safe Ambients. ACM Trans. Program. Lang. Syst. 25(1), 1\u201369 (2003)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"120_CR31","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.tcs.2004.10.007","volume":"330","author":"S. Maffeis","year":"2005","unstructured":"Maffeis S., Phillips I.: On the computational strength of pure ambient calculi. Theor. Comput. Sci. 330(3), 501\u2013551 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"120_CR32","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/1119479.1119482","volume":"28","author":"M. Merro","year":"2006","unstructured":"Merro M., Hennessy M.: A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2), 290\u2013330 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"120_CR33","doi-asserted-by":"crossref","unstructured":"Merro, M., Sassone, V.: Typing and subtyping mobility in boxed ambients. In: Proceedings of CONCUR. LNCS, vol. 2421, pp. 304\u2013320. Springer (2002)","DOI":"10.1007\/3-540-45694-5_21"},{"issue":"6","key":"120_CR34","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1145\/1101821.1101825","volume":"52","author":"M. Merro","year":"2005","unstructured":"Merro M., Zappa Nardelli F.: Behavioural theory for mobile ambients. J. ACM 52(6), 961\u20131023 (2005)","journal-title":"J. ACM"},{"issue":"2","key":"120_CR35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner R.: Functions as processes. Math. Struct. Comput. Sci. 2(2), 119\u2013141 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"120_CR36","doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial. In: Logic and algebra of specification. volume 94 of Series F. NATO ASI, Springer, Heidelberg (1993)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"120_CR37","doi-asserted-by":"crossref","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. Inf. Comput. 100, 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"120_CR38","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proceedings of ICALP. LNCS, vol. 623, pp. 685\u2013695. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"120_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U. Nestmann","year":"2000","unstructured":"Nestmann U., Pierce B.C.: Decoding choice encodings. Inf. Comput. 163, 1\u201359 (2000)","journal-title":"Inf. Comput."},{"key":"120_CR40","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/inco.1999.2822","volume":"156","author":"U. Nestmann","year":"2000","unstructured":"Nestmann U.: What is a \u2018good\u2019 encoding of guarded choice?. Inf. Comput. 156, 287\u2013319 (2000)","journal-title":"Inf. Comput."},{"issue":"5","key":"120_CR41","doi-asserted-by":"crossref","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-calculi. Math. Struct. Comput. Sci. 13(5), 685\u2013719 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"key":"120_CR42","doi-asserted-by":"crossref","unstructured":"Parrow, J.: Expressiveness of process algebras. In: Emerging Trends in Concurrency, ENTCS vol. 209, pp. 173\u2013186 (2008)","DOI":"10.1016\/j.entcs.2008.04.011"},{"key":"120_CR43","doi-asserted-by":"crossref","unstructured":"Phillips, A.T., Yoshida, N., Eisenbach, S.: A distributed abstract machine for boxed ambient calculi. In: Proceedings of ESOP. LNCS, vol. 2986, pp. 155\u2013170. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24725-8_12"},{"issue":"1","key":"120_CR44","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ic.2007.08.005","volume":"206","author":"I. Phillips","year":"2008","unstructured":"Phillips I., Vigliotti M.: Electoral systems in ambient calculi. Inf. Comput. 206(1), 34\u201372 (2008)","journal-title":"Inf. Comput."},{"issue":"3","key":"120_CR45","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.tcs.2006.02.004","volume":"356","author":"I.C.C. Phillips","year":"2006","unstructured":"Phillips I.C.C., Vigliotti M.G.: Leader election in rings of ambient processes. Theor. Comput. Sci. 356(3), 468\u2013494 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"120_CR46","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B.C. Pierce","year":"1996","unstructured":"Pierce B.C., Sangiorgi D.: Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6(5), 409\u2013454 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"key":"120_CR47","doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Turner, D.N.: Pict: a programming language based on the pi-calculus. In: Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/5641.003.0022"},{"key":"120_CR48","doi-asserted-by":"crossref","unstructured":"Rathke, J., Sassone V., Sobocinski, P.: Semantic barbs and biorthogonality. In: Proceedings of FoSSaCS. LNCS, vol. 4423, pp. 302\u2013316. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-71389-0_22"},{"key":"120_CR49","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)"},{"key":"120_CR50","doi-asserted-by":"crossref","unstructured":"Sewell, P.: Global\/local subtyping and capability inference for a distributed pi-calculus. In: Proceedings of ICALP. LNCS, vol. 1443, pp. 695\u2013706. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0055094"},{"key":"120_CR51","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1017\/S0960129503004079","volume":"13","author":"P. Zimmer","year":"2003","unstructured":"Zimmer P.: On the expressiveness of pure Safe Ambients. Math. Struct. Comput. Sci. 13, 721\u2013770 (2003)","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0120-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0120-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0120-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T19:27:53Z","timestamp":1711913273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0120-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0120-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,26]]}}}