From CCS to CSP: the m-among-n Synchronisation Approach
Logic in Computer Science
2022-09-13 v1 Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.2209.05232,
title = {From CCS to CSP: the m-among-n Synchronisation Approach},
author = {Gerard Ekembe Ngondi and Vasileios Koutavas and Andrew Butterfield},
journal= {arXiv preprint arXiv:2209.05232},
year = {2022}
}
Comments
In Proceedings EXPRESS/SOS 2022, arXiv:2208.14777