From CCS to CSP: the m-among-n Synchronisation Approach

Gerard Ekembe Ngondi
(Trinity College Dublin)
Vasileios Koutavas
(Trinity College Dublin)
Andrew Butterfield
(Trinity College Dublin)

We present an alternative translation from CCS to an extension of CSP based on m-among-n synchronisation (called CSPmn). This translation is correct up to strong bisimulation. Unlike the g-star renaming approach ([4]), this translation is not limited by replication (viz., recursion with no nested parallel composition). We show that m-among-n synchronisation can be implemented in CSP based on multiway synchronisation and renaming.

In Valentina Castiglioni and Claudio A. Mezzina: Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics (EXPRESS/SOS 2022), Warsaw, Poland, 12th September 2022, Electronic Proceedings in Theoretical Computer Science 368, pp. 60–74.
Published: 6th September 2022.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: