2000 character limit reached
From CCS to CSP: the m-among-n Synchronisation Approach (2209.05232v1)
Published 6 Sep 2022 in cs.LO and cs.FL
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.