Abstract
AbstractThis paper shows that the $$\pi $$
π
-calculus with implicit matching is no more expressive than $$\mathrm {CCS}_{\gamma }$$
CCS
γ
, 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 $$
τ
. This is done by exhibiting a compositional translation from the $$\pi $$
π
-calculus with implicit matching to $$\mathrm {CCS}_{\gamma }$$
CCS
γ
that is valid up to strong barbed bisimilarity.The full $$\pi $$
π
-calculus can be similarly expressed in $$\mathrm {CCS}_{\gamma }$$
CCS
γ
enriched with the triggering operation of Meije.I also show that these results cannot be recreated with CCS in the rôle of $$\mathrm {CCS}_{\gamma }$$
CCS
γ
, 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.
Publisher
Springer International Publishing
Reference34 articles.
1. Austry, D., Boudol, G.: Algèbre de processus et synchronisations. TCS 30(1), 91–131 (1984). https://doi.org/10.1016/0304-3975(84)90067-7
2. 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
3. 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
4. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: Mathematics and Computer Science, pp. 89–138. CWI Monograph 1, North-Holland (1986)
5. Boudol, G.: Asynchrony and the $$\pi $$-calculus (note). Tech. Rep. 1702, INRIA (1992)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Separation and Encodability in Mixed Choice Multiparty Sessions;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Mixed choice in session types;Information and Computation;2024-06
3. Comparing the Expressiveness of the π-calculus and CCS;ACM Transactions on Computational Logic;2023-11-18
4. On the Expressiveness of Mixed Choice Sessions;Electronic Proceedings in Theoretical Computer Science;2022-09-06