{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:14Z","timestamp":1750309154196,"version":"3.41.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:00:00Z","timestamp":1700265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>\n            This paper shows that the \u03c0-calculus with implicit matching is no more expressive than CCS\n            <jats:sub>\u03b3<\/jats:sub>\n            , a variant of CCS in which the result of a synchronisation of two actions is itself an action subject to relabelling or restriction, rather than the silent action \u03c4. This is done by exhibiting a compositional translation from the \u03c0-calculus with implicit matching to CCS\n            <jats:sub>\u03b3<\/jats:sub>\n            that is valid up to strong barbed bisimilarity.\n          <\/jats:p>\n          <jats:p>\n            The full \u03c0-calculus can be similarly expressed in CCS\n            <jats:sub>\u03b3<\/jats:sub>\n            enriched with the triggering operation of\n            <jats:sc>Meije<\/jats:sc>\n            .\n          <\/jats:p>\n          <jats:p>\n            I also show that these results cannot be recreated with CCS in the r\u00f4le of CCS\n            <jats:sub>\u03b3<\/jats:sub>\n            , not even up to reduction equivalence, and not even for the asynchronous \u03c0-calculus without restriction or replication.\n          <\/jats:p>\n          <jats:p>Finally, I observe that CCS cannot be encoded in the \u03c0-calculus.<\/jats:p>","DOI":"10.1145\/3611013","type":"journal-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T14:37:17Z","timestamp":1694702237000},"page":"1-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparing the Expressiveness of the \u03c0-calculus and CCS"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-7423","authenticated-orcid":false,"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[{"name":"Data61, CSIRO, Sydney, Australia and School of Computer Science and Engineering, University of New South Wales, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,11,18]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90067-7"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624193"},{"key":"e_1_3_3_4_2","article-title":"Mobility and Modularity: Expressing  \\(\\pi\\) -calculus in CCS","author":"Banach Richard","year":"1998","unstructured":"Richard Banach and Franck van Breugel. 1998. Mobility and Modularity: Expressing \\(\\pi\\) -calculus in CCS. Preprint. http:\/\/theory.stanford.edu\/rvg\/Pi.CCS.ext.abs.pdf","journal-title":"Preprint"},{"key":"e_1_3_3_5_2","first-page":"89","volume-title":"Mathematics and Computer Science","author":"Bergstra Jan A.","year":"1986","unstructured":"Jan A. Bergstra and Jan Willem Klop. 1986. Algebra of communicating processes. In Mathematics and Computer Science. North-Holland, 89\u2013138."},{"key":"e_1_3_3_6_2","volume-title":"Asynchrony and the  \\(\\pi\\) -calculus (Note)","author":"Boudol G\u00e9rard","year":"1992","unstructured":"G\u00e9rard Boudol. 1992. Asynchrony and the \\(\\pi\\) -calculus (Note). Tech. Rep. 1702. INRIA."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-011-9225-2"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00063-1"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2120-6_8"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.036"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.89.7"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_10"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99336-8_20"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233556"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000279"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/2628007"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00172-F"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(02)00082-9"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"e_1_3_3_22_2","volume-title":"Communication and Concurrency","author":"Milner Robin","year":"1989","unstructured":"Robin Milner. 1989. Communication and Concurrency. Prentice Hall, Englewood Cliffs."},{"key":"e_1_3_3_23_2","first-page":"1201","volume-title":"Handbook of Theoretical Computer Science","author":"Milner Robin","year":"1990","unstructured":"Robin Milner. 1990. Operational and algebraic semantics of concurrent processes. In Handbook of Theoretical Computer Science. Elsevier Science Publishers B.V. (North-Holland), Chapter 19, 1201\u20131242."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001407"},{"key":"e_1_3_3_25_2","volume-title":"Communicating and Mobile Systems: the  \\(\\pi\\) -Calculus","author":"Milner Robin","year":"1999","unstructured":"Robin Milner. 1999. Communicating and Mobile Systems: the \\(\\pi\\) -Calculus. Cambridge University Press."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90156-N"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_114"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_4"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004043"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000280"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_18"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-912-1_16"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050036"},{"key":"e_1_3_3_36_2","volume-title":"The  \\(\\pi\\) -calculus: A Theory of Mobile Processes","author":"Sangiorgi Davide","year":"2001","unstructured":"Davide Sangiorgi and David Walker. 2001. The \\(\\pi\\) -calculus: A Theory of Mobile Processes. Cambridge University Press."},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90093-3"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3611013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:52Z","timestamp":1750287052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,18]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3611013"],"URL":"https:\/\/doi.org\/10.1145\/3611013","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2023,11,18]]},"assertion":[{"value":"2023-01-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-12","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}