{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:29:25Z","timestamp":1767338965249},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853602"},{"type":"electronic","value":"9783540853619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_38","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T08:28:04Z","timestamp":1219048084000},"page":"492-507","source":"Crossref","is-referenced-by-count":26,"title":["Towards a Unified Approach to Encodability and Separation Results for Process Calculi"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Gorla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"38_CR2","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S. Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica\u00a029(8), 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"38_CR3","first-page":"22","volume-title":"Proc. of LICS","author":"M. Baldamus","year":"2004","unstructured":"Baldamus, M., Parrow, J., Victor, B.: Spi-Calculus Translated to Pi-Calculus Preserving Tests. In: Proc. of LICS, pp. 22\u201331. IEEE Computer Society, Los Alamitos (2004)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1007\/11523468_97","volume-title":"Automata, Languages and Programming","author":"M. Baldamus","year":"2005","unstructured":"Baldamus, M., Parrow, J., Victor, B.: A Fully Abstract Encoding of the Pi-Calculus with Data Terms. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1202\u20131213. Springer, Heidelberg (2005)"},{"key":"38_CR5","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus (note). Rapp. de Recherche 1702, INRIA (1992)"},{"key":"38_CR6","first-page":"251","volume-title":"Proc. of POPL","author":"M. Bugliesi","year":"2007","unstructured":"Bugliesi, M., Giunti, M.: Secure implementations of typed channel abstractions. In: Proc. of POPL, pp. 251\u2013262. ACM, New York (2007)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Cacciagrano, D., Corradini, F., Aranda, J., Valencia, F.: Persistence and Testing Semantics in the Asynchronous \u03c0-calculus. In: Proc. of EXPRESS. ENTCS, vol.\u00a0194(2), pp. 59\u201384 (2007)","DOI":"10.1016\/j.entcs.2007.11.006"},{"issue":"3","key":"38_CR8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.tcs.2007.07.009","volume":"386","author":"D. Cacciagrano","year":"2007","unstructured":"Cacciagrano, D., Corradini, F., Palamidessi, C.: Separation of Synchronous and Asynchronous Communication Via Testing. Theoretical Computer Science\u00a0386(3), 218\u2013235 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"38_CR9","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nordic Journal of Computing\u00a010(2), 70\u201398 (2003)","journal-title":"Nordic Journal of Computing"},{"issue":"2","key":"38_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0890-5401(01)93121-9","volume":"177","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the ambient calculus. Information and Computation\u00a0177(2), 160\u2013194 (2002)","journal-title":"Information and Computation"},{"issue":"1","key":"38_CR11","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.: Mobile ambients. Theor. Comp. Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theor. Comp. Science"},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1006\/inco.1994.1004","volume":"108","author":"F. Boer de","year":"1994","unstructured":"de Boer, F., Palamidessi, C.: Embedding as a tool for language comparison. Information and Computation\u00a0108(1), 128\u2013157 (1994)","journal-title":"Information and Computation"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalence for processes. TCS\u00a034, 83\u2013133 (1984)","journal-title":"TCS"},{"key":"38_CR14","unstructured":"Gorla, D.: Comparing calculi for mobility via their relative expressive power. Technical Report 09\/2006, Dipartimento di Informatica, Universit\u00e0 di Roma La Sapienza"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11690634_4","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Gorla","year":"2006","unstructured":"Gorla, D.: On the relative expressive power of asynchronous communication primitives. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 47\u201362. Springer, Heidelberg (2006)"},{"key":"38_CR16","series-title":"ENTCS","first-page":"87","volume-title":"Proc. of EXPRESS 2006","author":"D. Gorla","year":"2007","unstructured":"Gorla, D.: Synchrony vs asynchrony in communication primitives. In: Proc. of EXPRESS 2006. ENTCS, vol.\u00a0175, pp. 87\u2013108. Elsevier, Amsterdam (2007)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Haagensen, B., Maffeis, S., Phillips, I.: Matching systems for concurrent calculi. In: Proc. of EXPRESS 2007. ENTCS, vol.\u00a0194(2), pp. 85\u201399 (2007)","DOI":"10.1016\/j.entcs.2007.11.004"},{"key":"38_CR18","doi-asserted-by":"publisher","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. Information and Computation\u00a0173, 82\u2013120 (2002)","journal-title":"Information and Computation"},{"issue":"1","key":"38_CR19","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM ToPLaS\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM ToPLaS"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. TCS\u00a0152, 437\u2013486 (1995)","journal-title":"TCS"},{"issue":"6","key":"38_CR21","doi-asserted-by":"publisher","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.\u00a042(6), 429\u2013500 (2006)","journal-title":"Acta Inform."},{"key":"38_CR22","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"2","key":"38_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as Processes. Mathem. Struct. in Comp. Science\u00a02(2), 119\u2013141 (1992)","journal-title":"Mathem. Struct. in Comp. Science"},{"key":"38_CR24","series-title":"Series F. NATO ASI","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Logic and Algebra of Specification. Series F. NATO ASI, vol.\u00a094, Springer, Heidelberg (1993)"},{"key":"38_CR25","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)"},{"key":"38_CR26","doi-asserted-by":"publisher","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. Comp.\u00a0156, 287\u2013319 (2000)","journal-title":"Inf. Comp."},{"key":"38_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11817949_4","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"U. Nestmann","year":"2006","unstructured":"Nestmann, U.: Welcome to the jungle: A subjective guide to mobile process calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 52\u201363. Springer, Heidelberg (2006)"},{"key":"38_CR28","doi-asserted-by":"publisher","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. and Comp.\u00a0163, 1\u201359 (2000)","journal-title":"Inf. and Comp."},{"issue":"5","key":"38_CR29","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-calculi. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"38_CR30","first-page":"59","volume-title":"Proc. of LICS","author":"C. Palamidessi","year":"2006","unstructured":"Palamidessi, C., Saraswat, V., Valencia, F., Victor, B.: On the Expressiveness of Linearity vs Persistence in the Asynchronous \u03c0-calculus. In: Proc. of LICS, pp. 59\u201368. IEEE, Los Alamitos (2006)"},{"key":"38_CR31","series-title":"ENTCS","first-page":"173","volume-title":"Proc. of Emerging trends in Concurrency Theory","author":"J. Parrow","year":"2008","unstructured":"Parrow, J.: Expressiveness of Process Algebras. In: Proc. of Emerging trends in Concurrency Theory. ENTCS, vol.\u00a0209, pp. 173\u2013186. Elsevier, Amsterdam (2008)"},{"key":"38_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-540-24727-2_29","volume-title":"Foundations of Software Science and Computation Structures","author":"I. Phillips","year":"2004","unstructured":"Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 408\u2013422. Springer, Heidelberg (2004)"},{"issue":"3","key":"38_CR33","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.tcs.2006.02.004","volume":"356","author":"I. Phillips","year":"2006","unstructured":"Phillips, I., Vigliotti, M.: Leader election in rings of ambient processes. Theoretical Computer Science\u00a0356(3), 468\u2013494 (2006)","journal-title":"Theoretical Computer Science"},{"key":"38_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-71389-0_22","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Rathke","year":"2007","unstructured":"Rathke, J., Sassone, V., Sobocinski, P.: Semantic Barbs and Biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"key":"38_CR35","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. C.U.P (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T07:47:32Z","timestamp":1557733652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}