{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:09Z","timestamp":1760202729902,"version":"3.41.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_10","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T23:52:34Z","timestamp":1523663554000},"page":"183-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Theory of Encodings and Expressiveness (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1007\/11523468_97","volume-title":"International Colloquium on 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. 3580, pp. 1202\u20131213. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_97"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","volume":"195","author":"M Boreale","year":"1998","unstructured":"Boreale, M.: On the expressiveness of internal mobility in name-passing calculi. TCS 195(2), 205\u2013226 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00220-X","journal-title":"TCS"},{"key":"10_CR3","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-82453-1_9","volume-title":"Logics and Models of Concurrent Systems","author":"G Boudol","year":"1985","unstructured":"Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series, vol. 13, pp. 261\u2013303. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82453-1_9"},{"key":"10_CR4","unstructured":"Boudol, G.: Asynchrony and the $$\\pi $$\u03c0-calculus (Note). Technical report 1702, INRIA (1992)"},{"issue":"6","key":"10_CR5","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. Comput. Sci. 19(6), 1191\u20131222 (2009). https:\/\/doi.org\/10.1017\/S096012950999017X","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"10_CR6","first-page":"59","volume":"194","author":"D Cacciagrano","year":"2008","unstructured":"Cacciagrano, D., Corradini, F., Aranda, J., Valencia, F.D.: Linearity, persistence and testing semantics in the asynchronous pi-calculus. ENTCS 194(2), 59\u201384 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2007.11.006","journal-title":"ENTCS"},{"issue":"2","key":"10_CR7","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. Nord. J. Comput. 10(2), 70\u201398 (2003)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"10_CR8","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. TCS 240(1), 177\u2013213 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00231\u20135","journal-title":"TCS"},{"key":"10_CR9","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 equivalences for processes. TCS 34, 83\u2013133 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"TCS"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.07.043","volume":"611","author":"Y Fu","year":"2016","unstructured":"Fu, Y.: Theory of interaction. Theor. Comput. Sci. 611, 1\u201349 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.043","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-10882-7_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2014","author":"T Given-Wilson","year":"2014","unstructured":"Given-Wilson, T.: Expressiveness via intensionality and concurrency. In: Ciobanu, G., M\u00e9ry, D. (eds.) ICTAC 2014. LNCS, vol. 8687, pp. 206\u2013223. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10882-7_13"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.4204\/EPTCS.160.4","volume":"160","author":"Thomas Given-Wilson","year":"2014","unstructured":"Given-Wilson, T.: On the expressiveness of intensional communication. In: Proceedings of EXPRESS\/SOS 2014. EPTCS, vol. 160, pp. 30\u201346 (2014). https:\/\/doi.org\/10.4204\/EPTCS.160.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.4204\/EPTCS.189.9","volume":"189","author":"Thomas Given-Wilson","year":"2015","unstructured":"Given-Wilson, T., Legay, A.: On the expressiveness of joining. In: Proceedings of ICE 2015. EPTCS, vol. 189, pp. 99\u2013113 (2015). https:\/\/doi.org\/10.4204\/EPTCS.189.9","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"10_CR14","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-1-4471-2120-6_8","volume-title":"Proceedings of ACP 1994","author":"RJ Glabbeek van","year":"1994","unstructured":"van Glabbeek, R.J.: On the expressiveness of ACP (extended abstract). In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) ACP 1994. Workshops in Computing, pp. 188\u2013217. Springer, London (1994). https:\/\/doi.org\/10.1007\/978-1-4471-2120-6_8 . http:\/\/theory.stanford.edu\/~rvg\/abstracts.html#31"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11601548_4","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"RJ Glabbeek","year":"2005","unstructured":"Glabbeek, R.J.: A characterisation of weak bisimulation congruence. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 26\u201339. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11601548_4"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Musings on encodings and expressiveness. In: Proceedings of EXPRESS\/SOS 2012. EPTCS, vol. 89, pp. 81\u201398 (2012). https:\/\/doi.org\/10.4204\/EPTCS.89.7","DOI":"10.4204\/EPTCS.89.7"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: Lean and full congruence formats for recursion. In: Proceedings of LICS 2017 (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005142","DOI":"10.1109\/LICS.2017.8005142"},{"key":"10_CR18","unstructured":"van Glabbeek, R.J.: A theory of encodings and expressiveness (2018). http:\/\/theory.stanford.edu\/~rvg\/abstracts.html#tra . Full version of current paper"},{"issue":"4","key":"10_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"RJ Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, B., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fund. Inform. 93(4), 371\u2013392 (2009). https:\/\/doi.org\/10.3233\/FI-2009-109","journal-title":"Fund. Inform."},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00446-010-0120-6","volume":"23","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: A taxonomy of process calculi for distribution and mobility. Distrib. Comput. 23(4), 273\u2013299 (2010). https:\/\/doi.org\/10.1007\/s00446-010-0120-6","journal-title":"Distrib. Comput."},{"issue":"9","key":"10_CR21","first-page":"1031","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. I&C 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","journal-title":"I&C"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Gr\u00e4tzer, G.: Lattice theory: foundation (2010). https:\/\/doi.org\/10.1007\/978-3-0348-0018-1","DOI":"10.1007\/978-3-0348-0018-1"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4204\/EPTCS.190.5","volume":"190","author":"Meike Hatzel","year":"2015","unstructured":"Hatzel, M., Wagner, C., Peters, K., Nestmann, U.: Encoding CSP into CCS. In: Proceedings of EXPRESS\/SOS 2015. EPTCS, vol. 190, pp. 61\u201375 (2015). https:\/\/doi.org\/10.4204\/EPTCS.190.5","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP 1991 European Conference on Object-Oriented Programming","author":"K Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133\u2013147. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0057019"},{"key":"10_CR25","unstructured":"Lippert, C., Mennicke, S., van Glabbeek, R.J., Goltz, U.: A case study on evaluating encodings between process calculi. Technical report (2018). http:\/\/theory.stanford.edu\/~rvg\/abstracts.html#129"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0049-237X(08)71948-7","volume":"80","author":"R Milner","year":"1975","unstructured":"Milner, R.: Processes: a mathematical model for computing agents. Stud. Log. Found. Math. 80, 157\u2013173 (1975). https:\/\/doi.org\/10.1016\/S0049-237X(08)71948-7 . Logic Colloquium 1973","journal-title":"Stud. Log. Found. Math."},{"key":"10_CR27","first-page":"1201","volume-title":"Formal Models and Semantics","author":"Robin MILNER","year":"1990","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: Handbook of Theoretical Computer Science, Chap. 19, pp. 1201\u20131242 (1990)"},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1017\/S0960129500001407","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 623, pp. 685\u2013695. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_114"},{"issue":"1\u20132","key":"10_CR30","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 \u201cGood\u201d encoding of guarded choice? I&C 156(1\u20132), 287\u2013319 (2000). https:\/\/doi.org\/10.1006\/inco.1999.2822","journal-title":"I&C"},{"issue":"1","key":"10_CR31","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. I&C 163(1), 1\u201359 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2868 . An earlier version appeared in Proc. CONCUR \u201996","journal-title":"I&C"},{"issue":"5","key":"10_CR32","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 asynchronous pi-calculi. Math. Struct. Comput. Sci. 13(5), 685\u2013719 (2003). https:\/\/doi.org\/10.1017\/S0960129503004043","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Palamidessi, C., Saraswat, V.A., Valencia, F.D., Victor, B.: On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In: Proceedings of LICS 2006, pp. 59\u201368. IEEE Computer Society Press (2006). https:\/\/doi.org\/10.1109\/LICS.2006.39","DOI":"10.1109\/LICS.2006.39"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Parrow, J.: Trios in concert. In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 623\u2013638. The MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0030"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.entcs.2008.04.011","volume":"209","author":"Joachim Parrow","year":"2008","unstructured":"Parrow, J.: Expressiveness of process algebras. In: ENTCS, vol. 209, pp. 173\u2013186 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.04.011","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Peters, K.: Translational expressiveness. Comparing process calculi using encodings. Ph.D. thesis, TU Berlin (2012). https:\/\/doi.org\/10.14279\/depositonce-3416","DOI":"10.14279\/depositonce-3416"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"46","DOI":"10.4204\/EPTCS.190.4","volume":"190","author":"Kirstin Peters","year":"2015","unstructured":"Peters, K., van Glabbeek, R.J.: Analysing and comparing encodability criteria. In: EXPRESS\/SOS 2015. EPTCS, vol. 190, pp. 46\u201360 (2015). https:\/\/doi.org\/10.4204\/EPTCS.190.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-28729-9_14","volume-title":"Foundations of Software Science and Computational Structures","author":"K Peters","year":"2012","unstructured":"Peters, K., Nestmann, U.: Is it a \u201cGood\u201d encoding of mixed choice? In: Birkedal, L. (ed.) FoSSaCS 2012, vol. 7213, pp. 210\u2013224. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_14"},{"issue":"6","key":"10_CR39","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1017\/S0960129514000346","volume":"26","author":"K Peters","year":"2016","unstructured":"Peters, K., Nestmann, U.: Breaking symmetries. Math. Struct. Comput. Sci. 26(6), 1054\u20131106 (2016). https:\/\/doi.org\/10.1017\/S0960129514000346","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-37036-6_18","volume-title":"Programming Languages and Systems","author":"K Peters","year":"2013","unstructured":"Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 310\u2013329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_18"},{"issue":"3","key":"10_CR41","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.G.: Leader election in rings of ambient processes. TCS 356(3), 468\u2013494 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.02.004","journal-title":"TCS"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Riecke, J.G.: Fully abstract translations between functional languages. In: Proceedings of POPL 1991, pp. 245\u2013254. ACM Press (1991). https:\/\/doi.org\/10.1145\/99583.99617","DOI":"10.1145\/99583.99617"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-56610-4_62","volume-title":"TAPSOFT 1993: Theory and Practice of Software Development","author":"D Sangiorgi","year":"1993","unstructured":"Sangiorgi, D.: From $$\\pi $$\u03c0-calculus to higher-order $$\\pi $$\u03c0-calculus \u2014 and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993. LNCS, vol. 668, pp. 151\u2013166. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56610-4_62"},{"key":"10_CR44","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The $$\\pi $$\u03c0-calculus: A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$\u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Shapiro, E.Y.: Separating concurrent languages with categories of language embeddings. In: STOC 1991, pp. 198\u2013208. ACM (1991). https:\/\/doi.org\/10.1145\/103418.103423","DOI":"10.1145\/103418.103423"},{"issue":"1\u20133","key":"10_CR46","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.tcs.2007.09.001","volume":"388","author":"MG Vigliotti","year":"2007","unstructured":"Vigliotti, M.G., Phillips, I., Palamidessi, C.: Tutorial on separation results in process calculi via leader election problems. TCS 388(1\u20133), 267\u2013289 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.001","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:34:22Z","timestamp":1751564062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}