{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:44:55Z","timestamp":1743083095739,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030993351"},{"type":"electronic","value":"9783030993368"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"Abstract<\/jats:title>This paper shows that the $$\\pi $$<\/jats:tex-math>\n \u03c0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus with implicit matching is no more expressive than $$\\mathrm {CCS}_{\\gamma }$$<\/jats:tex-math>\n \n CCS<\/mml:mi>\n \u03b3<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, 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 $$\\tau $$<\/jats:tex-math>\n \u03c4<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. This is done by exhibiting a compositional translation from the $$\\pi $$<\/jats:tex-math>\n \u03c0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus with implicit matching to $$\\mathrm {CCS}_{\\gamma }$$<\/jats:tex-math>\n \n CCS<\/mml:mi>\n \u03b3<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that is valid up to strong barbed bisimilarity.<\/jats:p>The full $$\\pi $$<\/jats:tex-math>\n \u03c0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus can be similarly expressed in $$\\mathrm {CCS}_{\\gamma }$$<\/jats:tex-math>\n \n CCS<\/mml:mi>\n \u03b3<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> enriched with the triggering operation of Meije<\/jats:sc>.<\/jats:p>I also show that these results cannot be recreated with CCS in the r\u00f4le of $$\\mathrm {CCS}_{\\gamma }$$<\/jats:tex-math>\n \n CCS<\/mml:mi>\n \u03b3<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, not even up to reduction equivalence, and not even for the asynchronous $$\\pi $$<\/jats:tex-math>\n \u03c0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus without restriction or replication.<\/jats:p>Finally I observe that CCS cannot be encoded in the $$\\pi $$<\/jats:tex-math>\n \u03c0<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus.<\/jats:p>","DOI":"10.1007\/978-3-030-99336-8_20","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"548-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing the expressiveness of the $$\\pi $$-calculus and CCS"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4712-7423","authenticated-orcid":false,"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Austry, D., Boudol, G.: Alg\u00e8bre de processus et synchronisations. TCS 30(1), 91\u2013131 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90067-7","DOI":"10.1016\/0304-3975(84)90067-7"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press (1990). https:\/\/doi.org\/10.1017\/CBO9780511624193","DOI":"10.1017\/CBO9780511624193"},{"key":"20_CR3","unstructured":"Banach, R., van Breugel, F.: Mobility and modularity: expressing $$\\pi $$-calculus in CCS. Preprint (1998), http:\/\/www.cs.man.ac.uk\/~banach\/some.pubs\/Pi.CCS.ext.abs.pdf"},{"key":"20_CR4","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: Mathematics and Computer Science, pp. 89\u2013138. CWI Monograph 1, North-Holland (1986)"},{"key":"20_CR5","unstructured":"Boudol, G.: Asynchrony and the $$\\pi $$-calculus (note). Tech. Rep.\u00a01702, INRIA (1992)"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J.\u00a0ACM 31(3), 560\u2013599 (1984). https:\/\/doi.org\/10.1145\/828.833","DOI":"10.1145\/828.833"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Ferrari, G.L., Montanari, U., Quaglia, P.: A pi-calculus with explicit substitutions. Theoretical Computer Science 168(1), 53\u2013103 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(96)00063-1","DOI":"10.1016\/S0304-3975(96)00063-1"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J. van: On the expressiveness of ACP (extended abstract). In: Proc. ACP\u201994. pp. 188\u2013217. Workshops in Computing, Springer (1994). https:\/\/doi.org\/10.1007\/978-1-4471-2120-6_8","DOI":"10.1007\/978-1-4471-2120-6_8"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J. van: On cool congruence formats for weak bisimulations. Theoretical Computer Science 412(28), 3283\u20133302 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.02.036","DOI":"10.1016\/j.tcs.2011.02.036"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J. van: Musings on encodings and expressiveness. In: Proc. EXPRESS\/SOS\u201912. EPTCS, vol.\u00a089, pp. 81\u201398. Open Publishing Association (2012). https:\/\/doi.org\/10.4204\/EPTCS.89.7","DOI":"10.4204\/EPTCS.89.7"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J. van: A theory of encodings and expressiveness. In: Proc. FoSSaCS\u201918. LNCS, vol. 10803, pp. 183\u2013202. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_10","DOI":"10.1007\/978-3-319-89366-2_10"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Glabbeek, R.J. van, Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), 555\u2013600 (1996). https:\/\/doi.org\/10.1145\/233551.233556","DOI":"10.1145\/233551.233556"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Information and Computation 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Gorla, D., Nestmann, U.: Full abstraction for expressiveness: history, myths and facts. Mathematical Structures in Computer Science 26(4), 639\u2013654 (2016). https:\/\/doi.org\/10.1017\/S0960129514000279","DOI":"10.1017\/S0960129514000279"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press (2014)","DOI":"10.7551\/mitpress\/9946.001.0001"},{"key":"20_CR16","doi-asserted-by":"publisher","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Comp. Sc. 138(2), 353\u2013389 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00172-F","DOI":"10.1016\/0304-3975(94)00172-F"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Luttik, B.: On the expressiveness of choice quantification. Ann. Pure Appl. Logic 121, 39\u201387 (2003). https:\/\/doi.org\/10.1016\/S0168-0072(02)00082-9","DOI":"10.1016\/S0168-0072(02)00082-9"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoretical Comp. Sc. 25, 267\u2013310 (1983). https:\/\/doi.org\/10.1016\/0304-3975(83)90114-7","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"20_CR19","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: Handbook of Theoretical Computer Science, chap.\u00a019, pp. 1201\u20131242. Elsevier Science Publishers B.V. (North-Holland) (1990)","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2(2), 119\u2013141 (1992). https:\/\/doi.org\/10.1017\/S0960129500001407","DOI":"10.1017\/S0960129500001407"},{"key":"20_CR22","unstructured":"Milner, R.: Communicating and Mobile Systems: the $$\\pi $$-Calculus. Cambridge University Press (1999)"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I. I&C 100, 1\u201340 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, II. I&C 100, 41\u201377 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90009-5","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. TCS 114, 149\u2013171 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90156-N","DOI":"10.1016\/0304-3975(93)90156-N"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proc. ICALP\u201992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_114","DOI":"10.1007\/3-540-55719-9_114"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Nestmann, U.: Welcome to the jungle: A subjective guide to mobile process calculi. In: Proc. CONCUR\u201906. LNCS, vol.\u00a04137, pp. 52\u201363. Springer (2006). https:\/\/doi.org\/10.1007\/11817949_4","DOI":"10.1007\/11817949_4"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Mathematical Structures in Comp. Science 13(5), 685\u2013719 (2003). https:\/\/doi.org\/10.1017\/S0960129503004043","DOI":"10.1017\/S0960129503004043"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Parrow, J.: General conditions for full abstraction. Math. Struct. in Comp. Sc. 26(4), 655\u2013657 (2016). https:\/\/doi.org\/10.1017\/S0960129514000280","DOI":"10.1017\/S0960129514000280"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Proc. ESOP\u201913. LNCS, vol.\u00a07792, pp. 310\u2013329. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_18","DOI":"10.1007\/978-3-642-37036-6_18"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Roscoe, A.W.: CSP is expressive enough for $$\\pi $$. In: Reflections on the Work of C.A.R. Hoare, pp. 371\u2013404. Springer (2010). https:\/\/doi.org\/10.1007\/978-1-84882-912-1_16","DOI":"10.1007\/978-1-84882-912-1_16"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Inf. 33(1), 69\u201397 (1996). https:\/\/doi.org\/10.1007\/s002360050036","DOI":"10.1007\/s002360050036"},{"key":"20_CR33","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Simone, R. de: Higher-level synchronising devices in Meije-SCCS. TCS 37, 245\u2013267 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90093-3","DOI":"10.1016\/0304-3975(85)90093-3"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99336-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T05:09:41Z","timestamp":1731647381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99336-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030993351","9783030993368"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99336-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/esop","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}