Paper Info
Title
Comparing the expressiveness of the pi-calculus and CCS
Abstract
This paper shows that the pi-calculus with implicit matching is no more expressive than CCS pi, 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 pi. This is done by exhibiting a compositional translation from the pi-calculus with implicit matching to CCS pi that is valid up to strong barbed bisimilarity. The full pi-calculus can be similarly expressed in CCS pi enriched with the triggering operation of MEIJE. I also show that these results cannot be recreated with CCS in the r<^>ole of CCS pi, not even up to reduction equivalence, and not even for the asynchronous pi-calculus without restriction or replication. Finally I observe that CCS cannot be encoded in the pi-calculus.
Year
DOI
Venue
2021
10.1007/978-3-030-99336-8_20
PROGRAMMING LANGUAGES AND SYSTEMS, ESOP 2022
DocType
Volume
ISSN
Conference
13240
0302-9743
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Rob J. van Glabbeek11930134.34