In a theory of processes the names are atomic data items which can be exchanged and tested for identity, but which admit no other functions or predicates. A well-known example of a calculus for name-passing is the π-calculus, where names additionally are used as communication ports. We provide complete axiomatisations of late and early bisimulation equivalences in such calculi. Since neither of the equivalences is a congruence we also axiomatise the corresponding largest congruences. We consider a few variations of the signature of the language, among these, a calculus of deterministic processes which is reminiscent of sequential functional programs with a conditional construct. Most of our axioms have been shoivn to be independent. The structure of the systems reveals the symmetries of the calculi and equivalences since they differ only by a few simple axioms.
CITATION STYLE
Parrow, J., & Sangiorgi, D. (1994). Algebraic theories for name-passing calculi. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 803 LNCS, pp. 509–529). Springer Verlag. https://doi.org/10.1007/3-540-58043-3_27
Mendeley helps you to discover research relevant for your work.