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)
TL;DR
This paper introduces a new translation method from CCS to an extended CSP using m-among-n synchronisation, which overcomes limitations of previous approaches and is implementable in CSP.
Contribution
It presents a novel translation approach from CCS to CSP with m-among-n synchronisation, not limited by recursion or nested parallelism, and proves its correctness.
Findings
The translation is correct up to strong bisimulation.
M-among-n synchronisation can be implemented in CSP.
The approach overcomes limitations of previous g-star renaming methods.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.