On characterising strong bisimilarity in a fragment of CCS with replication
Logic in Computer Science
2008-10-14 v1
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.
Cite
@article{arxiv.0810.2061,
title = {On characterising strong bisimilarity in a fragment of CCS with replication},
author = {Daniel Hirschkoff and Damien Pous},
journal= {arXiv preprint arXiv:0810.2061},
year = {2008}
}