{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:21Z","timestamp":1767339561324},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T00:00:00Z","timestamp":1350518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s00236-012-0168-9","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T20:55:29Z","timestamp":1350507329000},"page":"445-484","source":"Crossref","is-referenced-by-count":12,"title":["Distinguishing and relating higher-order and first-order processes by expressiveness"],"prefix":"10.1007","volume":"49","author":[{"given":"Xian","family":"Xu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,18]]},"reference":[{"key":"168_CR1","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":"168_CR2","unstructured":"Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: Encoding the pi-calculus in higher-order calculi. Tech. Rep. TR-2008-106, IT University of Copenhagen (2008)"},{"key":"168_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.tcs.2006.02.006","volume":"356","author":"M Bundgaard","year":"2006","unstructured":"Bundgaard, M., Hildebrandt, T., Godskesen, J.C.: A cps encoding of name-passing in higher-order mobile embedded resources. Theor. Comput. Sci. 356, 422\u2013439 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"168_CR4","doi-asserted-by":"crossref","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs recursive definitions in channel based calculi. In: Proceedings of ICALP 2003, LNCS, vol. 2719, pp. 133\u2013144. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45061-0_12"},{"key":"168_CR5","doi-asserted-by":"crossref","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication and iteration in process calculi. In: Proceedings of ICALP04, LNCS, vol. 3142, pp. 307\u2013319. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-27836-8_28"},{"issue":"1","key":"168_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.11.005","volume":"201","author":"G Castagnaa","year":"2005","unstructured":"Castagnaa, G., Vitekb, J., Nardelli, F.Z.: The seal calculus. Inform. Comput. 201(1), 1\u201354 (2005)","journal-title":"Inform. Comput."},{"key":"168_CR7","unstructured":"Engberg, U.H., Nielsen, M.: A calculus of communicating systems with label passing. Tech. Rep. DAIMI PB-208, Computer Science Department, University of Aarhus (1986). http:\/\/www.daimi.aau.dk\/PB\/208\/"},{"key":"168_CR8","doi-asserted-by":"crossref","unstructured":"Engberg, U.H., Nielsen, M.: A calculus of communicating systems with label passing\u2014ten years after. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 599\u2013622. MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/5641.003.0029"},{"key":"168_CR9","unstructured":"Fu, Y.: Checking equivalence for higher order processes (2005). BASICS ( http:\/\/basics.sjtu.edu.cn ) Shanghai Jiao Tong University"},{"issue":"1\u20133","key":"168_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. Theor. Comput. Sci. 338(1\u20133), 96\u2013126 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"168_CR11","unstructured":"Fu, Y.: Theory of interaction (2009). BASICS ( http:\/\/basics.sjtu.edu.cn ) Shanghai Jiao Tong University"},{"key":"168_CR12","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. Theor. Comput. Sci. 411, 1387\u20131451 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"168_CR13","unstructured":"Fu, Y., Zhu, H.: Theory of name passing calculus (2009). BASICS ( http:\/\/basics.sjtu.edu.cn ) Shanghai Jiao Tong University"},{"key":"168_CR14","doi-asserted-by":"crossref","unstructured":"Glabeek, R.: The linear time-branching time spectrum ii. In: Proceedings of CONCUR, LNCS, vol. 715, pp. 66\u201381. Springer, Berlin (1993)","DOI":"10.1007\/3-540-57208-2_6"},{"key":"168_CR15","doi-asserted-by":"crossref","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. In: Proceedings of CONCUR\u2019 08, LNCS, vol. 5201, pp. 492\u2013507. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85361-9_38"},{"key":"168_CR16","unstructured":"Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for Homer\u2014a calculus of higher order mobile embedded resources. Tech. Rep. TR-2004-52, IT University of Copenhagen (2004)"},{"key":"168_CR17","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 the 23rd annual IEEE symposium on logic in computer science (LICS 2008), pp. 145\u2013155. IEEE Computer Society (2008). Journal version in [22]","DOI":"10.1109\/LICS.2008.8"},{"issue":"2","key":"168_CR18","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ic.2010.10.001","volume":"209","author":"I Lanese","year":"2010","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. Inform. Comput. 209(2), 198\u2013226 (2010)","journal-title":"Inform. Comput."},{"key":"168_CR19","doi-asserted-by":"crossref","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness of polyadic and synchronous communication in higher-order process calculi. In: Proceedings of ICALP 2010, LNCS, pp. 442\u2013453. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14162-1_37"},{"key":"168_CR20","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, New Jersey (1989)"},{"key":"168_CR21","unstructured":"Milner, R.: Functions as processes. J. Math. Struct. Comput. Sci. 2(2), 119\u2013141, : Research Report 1154. INRIA, Sofia Antipolis (1992). 1990"},{"issue":"1","key":"168_CR22","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 (parts i and ii). Inform. Comput. 100(1), 1\u201377 (1992)","journal-title":"Inform. Comput."},{"key":"168_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proceedings 19-the International Colloquium on Automata, Languages and Programming (ICALP \u201992), LNCS, Vol. 623, pp. 685\u2013695. Springer, Berlin (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"168_CR24","doi-asserted-by":"crossref","unstructured":"Nestmann, U., Pierce, B.: Decoding choice encodings. In: Proceedings of CONCUR 1996, LNCS, vol. 1119, pp. 179\u2013194. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61604-7_55"},{"key":"168_CR25","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":"168_CR26","doi-asserted-by":"crossref","unstructured":"Palamidessi, C., Saraswat, V., Valencia, F.D., Victor, B.: On the expressiveness of linearity vs. persistence in the asychronous pi-calculus. In: Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS\u201906), pp. 59\u201368. IEEE Computer Society (2006)","DOI":"10.1109\/LICS.2006.39"},{"key":"168_CR27","unstructured":"Plotkin, G.: A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Aarhus Universitetsforlag (1981)"},{"key":"168_CR28","doi-asserted-by":"crossref","unstructured":"Pous, D.: Up-to techniques for weak bisimulation. In: Proceedings of International Colloquium on Automata, Languages and Programming (ICALP 2005), LNCS, Vol. 3580, pp. 730\u2013741. Springer, Berlin (2005)","DOI":"10.1007\/11523468_59"},{"key":"168_CR29","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.d. thesis, University of Edinburgh (1992)"},{"key":"168_CR30","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: From $$\\pi $$ -calculus to higher-order $$\\pi $$ -calculus\u2014and back. In: Proceedings TAPSOFT \u201993, LNCS, Vol. 668, pp. 151\u2013166. Springer, Berlin (1992)","DOI":"10.1007\/3-540-56610-4_62"},{"issue":"2","key":"168_CR31","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation for higher-order process calculi. Inform. Comput. 131(2), 141\u2013178 (1996)","journal-title":"Inform. Comput."},{"key":"168_CR32","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Pi-calculus, internal mobility and agent-passing calculi. Theor. Comput. Sci. 167(2) (1996)","DOI":"10.1016\/0304-3975(96)00075-8"},{"issue":"1","key":"168_CR33","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for $$\\pi $$ -calculus. Acta Informatica 33(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"issue":"6","key":"168_CR34","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Math. Struct. Comput. Sci. 8(6), 447\u2013479 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"key":"168_CR35","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Milner, R.: The problem of weak bisimulation up-to. In: Proceedings of CONCUR\u201992, LNCS, vol. 630, pp. 32\u201346. Springer, Berlin (1992)","DOI":"10.1007\/BFb0084781"},{"key":"168_CR36","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: On barbed equivalences in pi-calculus. In: Proceedings of CONCUR\u201901, LNCS, vol. 2154, pp. 292\u2013304. Springer, Berlin (2001)","DOI":"10.1007\/3-540-44685-0_20"},{"key":"168_CR37","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 Universtity Press, Cambridge (2001)"},{"key":"168_CR38","doi-asserted-by":"crossref","unstructured":"Schmitt, A., Stefani, J.B.: The m-calculus: A higher-order distributed process calculus. In: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 50\u201361. ACM (2003)","DOI":"10.1145\/604131.604136"},{"key":"168_CR39","doi-asserted-by":"crossref","unstructured":"Schmitt, A., Stefani, J.B.: The kell calculus: A family of higher-order distributed process calculi. In: Proceedings of the International Workshop on Global Computing 2004 Workshop (GC 2004), pp. 146\u2013178. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-31794-4_9"},{"key":"168_CR40","unstructured":"Thomsen, B.: Calculi for higher order communicating systems. Ph.d. thesis, Department of Computing, Imperial College (1990)"},{"issue":"1","key":"168_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B Thomsen","year":"1993","unstructured":"Thomsen, B.: Plain chocs, a second generation calculus for higher-order processes. Acta Informatica 30(1), 1\u201359 (1993)","journal-title":"Acta Informatica"},{"key":"168_CR42","unstructured":"van Glabbeek, R.: What is branching time semantics and why to use it? In: G. Paun, G. Rozenberg, A. Salomaa (eds.) Current trends in theoretical computer science; entering the 21th century, pp. 469\u2013479. World Scientific (1994)"},{"key":"168_CR43","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: Linear time-branching time spectrum i. In: Handbook of process algebra, pp. 3\u201399. North-Holland (2001)","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"168_CR44","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"R Glabbeek van","year":"2009","unstructured":"van Glabbeek, R., Luttik, B., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fundamenta Informaticae 93, 371\u2013392 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"168_CR45","unstructured":"van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. In: Information processing\u201989, pp. 613\u2013618. North-Holland (1989)"},{"key":"168_CR46","unstructured":"Xu, X.: On the bisimulation theory and axiomatization of higher-order process calculi. Ph.D. thesis, BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China, P.R. (2008)"},{"issue":"1","key":"168_CR47","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s11390-009-9210-y","volume":"24","author":"X Xu","year":"2009","unstructured":"Xu, X.: Expressing first-order $$\\pi $$ -calculus in higher-order calculus of communicating systems. J. Comput. Sci. Technol. 24(1), 122\u2013137 (2009)","journal-title":"J. Comput. Sci. Technol."},{"issue":"5800","key":"168_CR48","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-642-04856-2_10","volume":"III","author":"X Xu","year":"2009","unstructured":"Xu, X.: On bisimulation theory in linear higher-order pi-calculus. Trans. Petri Nets Other Models Concurr. III(5800), 244\u2013274 (2009)","journal-title":"Trans. Petri Nets Other Models Concurr."},{"key":"168_CR49","doi-asserted-by":"crossref","unstructured":"Yin, Q., Long, H.: Process passing calculus, revisited. J. Shanghai Jiao Tong Univ. (Sci.) (2012). To appear","DOI":"10.1007\/s12204-013-1365-6"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0168-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-012-0168-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0168-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T10:39:38Z","timestamp":1714473578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-012-0168-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,18]]},"references-count":49,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s00236-012-0168-9","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,18]]}}}