We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level replications. Our proof relies on algebraic properties of replication, and on a new syntactic characterisation of bisimilarity. We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence. Whether bisimilarity is a congruence when replications are unrestricted remains open. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hirschkoff, D., & Pous, D. (2010). On bisimilarity and substitution in presence of replication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6199 LNCS, pp. 454–465). https://doi.org/10.1007/978-3-642-14162-1_38
Mendeley helps you to discover research relevant for your work.