Algebraic Theories for Name-Passing Calculi (1993)
| Citations: | 41 - 10 self |
BibTeX
@MISC{Sangiorgi93algebraictheories,
author = {Davide Sangiorgi and Joachim Parrow and Joachim Parrow},
title = {Algebraic Theories for Name-Passing Calculi},
year = {1993}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 ß-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 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. Work supported by the ESPRIT BRA project 6454 "CONFER". Swedish Institute of Computer Science, Uppsala University, and The Royal Institute of Technology, Sweden y LFCS, Dep...
