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

09/06/2022

∙

by   Gerard Ekembe Ngondi, et al.

∙

0

∙

share

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.