Parrow, Joachim; Sangiorgi, Davide Algebraic theories for name-passing calculi. (English) Zbl 0836.03020 Inf. Comput. 120, No. 2, 174-197 (1995). Summary: In a theory of processes the names are atomic data items which can be exchanged and tested for identity. A well-known example of a calculus for name-passing is the \(\pi\)-calculus, where names are additionally used as communication ports. We provide complete axiomatisations of late and early bisimilarity 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 are shown to be independent. The axiom systems differ only by a few simple axioms and reveal the similarities and the symmetries of the calculi and the equivalences. Cited in 27 Documents MSC: 03B70 Logic in computer science 68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) 68Q55 Semantics in the theory of computing Keywords:calculi for name-passing; process calculi; concurrency; bisimilarity equivalences; congruences; deterministic processes PDFBibTeX XMLCite \textit{J. Parrow} and \textit{D. Sangiorgi}, Inf. Comput. 120, No. 2, 174--197 (1995; Zbl 0836.03020) Full Text: DOI Link