{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:11:22Z","timestamp":1750997482435,"version":"3.41.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319694825"},{"type":"electronic","value":"9783319694832"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69483-2_11","type":"book-chapter","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T11:34:48Z","timestamp":1508153688000},"page":"183-199","source":"Crossref","is-referenced-by-count":1,"title":["Remark on Some $$\\pi $$ Variants"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Xue","sequence":"first","affiliation":[]},{"given":"Huan","family":"Long","sequence":"additional","affiliation":[]},{"given":"Yuxi","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61604-7_53","volume-title":"CONCUR 1996: Concurrency Theory","author":"RM Amadio","year":"1996","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous $$\\pi $$ -calculus. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 147\u2013162. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61604-7_53"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"J Baeten","year":"1996","unstructured":"Baeten, J.: Branching bisimilarity is an equivalence indeed. Inform. Process. Lett. 58, 141\u2013147 (1996)","journal-title":"Inform. Process. Lett."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45061-0_12","volume-title":"Automata, Languages and Programming","author":"N Busi","year":"2003","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133\u2013144. Springer, Heidelberg (2003). doi: 10.1007\/3-540-45061-0_12"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-27836-8_28","volume-title":"Automata, Languages and Programming","author":"N Busi","year":"2004","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 307\u2013319. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27836-8_28"},{"key":"11_CR5","unstructured":"Boudol, G.: Asynchrony and the $$\\pi $$ -calculus. Technical report RR-1702, INRIA Sophia-Antipolis (1992)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1017\/S0960129511000260","volume":"21","author":"X Cai","year":"2011","unstructured":"Cai, X., Fu, Y.: The $$\\lambda $$ -calculus in the $$\\pi $$ -calculus. Math. Struct. Comput. Sci. 21, 943\u2013996 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR 1990 Theories of Concurrency: Unification and Extension","author":"R Nicola","year":"1990","unstructured":"Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152\u2013165. Springer, Heidelberg (1990). doi: 10.1007\/BFb0039058"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theoret. Comput. Sci. 411, 1387\u20131451 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR9","unstructured":"Fu, Y.: The universal process. In: Logical Methods in Computer Science (to appear)"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2004.10.041","volume":"338","author":"Y Fu","year":"2005","unstructured":"Fu, Y.: On quasi open bisimulation. Theoret. Comput. Sci. 338, 96\u2013126 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-15375-4_28","volume-title":"CONCUR 2010 - Concurrency Theory","author":"Y Fu","year":"2010","unstructured":"Fu, Y.: Theory by process. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 403\u2013416. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15375-4_28"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-39698-4_11","volume-title":"Theories of Programming and Formal Methods","author":"Y Fu","year":"2013","unstructured":"Fu, Y.: The Value-Passing Calculus. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 166\u2013195. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39698-4_11"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2015.07.043","volume":"611","author":"Y Fu","year":"2016","unstructured":"Fu, Y.: Theory of interaction. Theoret. Comput. Sci. 611, 1\u201349 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR14","unstructured":"Fu, Y.: On the expressive power of name-passing communication. In: CONCUR 2017 (2017)"},{"key":"11_CR15","unstructured":"Fu, Y., Zhu, H.: The name-passing calculus. arXiv:1508.00093 (2015)"},{"key":"11_CR16","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, 931\u2013952 (2008)","journal-title":"Inf. Comput."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-24727-2_17","volume-title":"Foundations of Software Science and Computation Structures","author":"P Giambiagi","year":"2004","unstructured":"Giambiagi, P., Schneider, G., Valencia, F.D.: On the expressiveness of infinite behavior and name scoping in process calculi. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 226\u2013240. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24727-2_17"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C Hoare","year":"1978","unstructured":"Hoare, C.: Communicating sequential processes. Commun. ACM 21, 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"key":"11_CR19","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). doi: 10.1007\/BFb0057019"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Nierstrasz, O., Wegner, P. (eds.) ECOOP 1991. LNCS, vol. 612, pp. 21\u201351. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55613-3_2"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Lanese, I., Perez, J., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: Proceedings of LICS 2008, pp. 145\u2013155 (2008)","DOI":"10.1109\/LICS.2008.8"},{"key":"11_CR22","unstructured":"Merro, M.: Locality in the $$\\pi $$ -calculus and applications to object-oriented languages. PhD thesis, Ecole des Mines de Paris (2000)"},{"key":"11_CR23","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"key":"11_CR24","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, 119\u2013146 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR25","series-title":"NATO ASI Series (Series F: Computer & Systems Sciences)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-58041-3_6","volume-title":"Logic and Algebra of Specification","author":"R Milner","year":"1993","unstructured":"Milner, R.: The polyadic $$\\pi $$ -calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series (Series F: Computer & Systems Sciences), vol. 94, pp. 203\u2013246. Springer, Heidelberg (1993). doi: 10.1007\/978-3-642-58041-3_6"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inform. Comput. 100, 1\u201340 (Part I), 41\u201377 (Part II) (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"11_CR27","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). doi: 10.1007\/3-540-55719-9_114"},{"key":"11_CR28","doi-asserted-by":"crossref","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. Math. Struct. Comput. Sci. 14, 715\u2013767 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR29","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 $$\\pi $$ -calculus. Math. Struct. Comput. Sci. 13, 685\u2013719 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). doi: 10.1007\/BFb0017309"},{"key":"11_CR31","first-page":"85","volume":"7","author":"L Priese","year":"1978","unstructured":"Priese, L.: On the concept of simulation in asynchronous, concurrent systems. Progress Cybern. Syst. Res. 7, 85\u201392 (1978)","journal-title":"Progress Cybern. Syst. Res."},{"key":"11_CR32","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1995.1108","volume":"120","author":"J Parrow","year":"1995","unstructured":"Parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Inf. Comput. 120, 174\u2013197 (1995)","journal-title":"Inf. Comput."},{"key":"11_CR33","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1987","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"11_CR34","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 $$ -calculus to higher-order $$\\pi $$ -calculus \u2013 and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993. LNCS, vol. 668, pp. 151\u2013166. Springer, Heidelberg (1993). doi: 10.1007\/3-540-56610-4_62"},{"key":"11_CR35","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: $$\\pi $$ -calculus, internal mobility and agent-passing calculi. Theoret. Comput. Sci. 167, 235\u2013274 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR36","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","volume":"3","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for $$\\pi $$ -calculus. Acta Informatica 3, 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"11_CR37","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The $$\\pi $$ Calculus: A Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$ Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"11_CR38","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1004","volume":"116","author":"B Thomsen","year":"1995","unstructured":"Thomsen, B.: A theory of higher order communicating systems. Inf. Comput. 116, 38\u201357 (1995)","journal-title":"Inf. Comput."},{"key":"11_CR39","unstructured":"van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. In: Information Processing 1989, North-Holland, pp. 613\u2013618 (1989)"},{"key":"11_CR40","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/inco.1995.1018","volume":"116","author":"D Walker","year":"1995","unstructured":"Walker, D.: Objects in the $$\\pi $$ -calculus. Inf. Comput. 116, 253\u2013271 (1995)","journal-title":"Inf. Comput."},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Xu, X., Yin, Q., Long, H.: On the computation power of name parameterization in higher-order processes. In: ICE 2015 (2015)","DOI":"10.4204\/EPTCS.189.10"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69483-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:18:13Z","timestamp":1750947493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69483-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694825","9783319694832"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69483-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}