On characterising strong bisimilarity in a fragment of CCS with replication

Simple item page
dc.creatorHirschkoff, Daniel
dc.creatorPous, Damien
dc.date2008-10-12
dc.date.accessioned2026-07-07T10:09:31Z
dc.date.available2026-07-07T10:09:31Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0810.2061
dc.identifierhttp://arxiv.org/abs/0810.2061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171341
dc.subjectLogic in Computer Science
dc.titleOn characterising strong bisimilarity in a fragment of CCS with replication
dc.typetext

Files

Collections

arXiv