On characterising strong bisimilarity in a fragment of CCS with replication

2008/10/12 by Hirschkoff, Daniel, Pous, Damien
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.0810.2061

Abstract

We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The characterisation is not an axiomatisation, but is instead presented as a rewriting system. We discuss how our method allows us to derive a new congruence result in the π-calculus: congruence holds in the sub-calculus that does not include restriction nor sum, and features a limited form of replication. We have not formalised the latter result in all details.

Related

• On the Axiomatisation of Branching Bisimulation Congruence over CCS
• On Bisimulation in Absence of Restriction
• Comparing the expressiveness of the π-calculus and CCS
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
• In search of lost time: Axiomatising parallel composition in process algebras