Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Some congruence properties for &pgr;-calculus bisimilarities
Theoretical Computer Science
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the bisimulation proof method
Mathematical Structures in Computer Science
On the Expressiveness and Decidability of Higher-Order Process Calculi
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
On unique decomposition of processes in the applied π-calculus
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
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.