TY  - JOUR
SN  - 0890-5401
Y1  - 1996///
JF  - Information and Computation
N2  - We use symbolic transition systems as a basis for providing the?-calculus with an alternative semantics. The latter is more amenable to automatic manipulation and sheds light on the logical differences among different forms of bisimulation over algebras of name-passing processes. Symbolic transitions have the form[formula], where?is a boolean combination of equalities on names that has to hold for the transition to take place, and?is standard a?-calculus action. On top of the symbolic transition system, a symbolic bisimulation is defined that captures the standard ones. Finally, a sound and complete proof system is introduced for symbolic bisimulation.
N1  - An extended abstract of this paper appears in: B. Jonsson and J. Parrow (eds.), Proceedings of CONCUR'94, Lectures Notes in Computer Science 836, Springer-Verlag, 1994.
PB  - Elsevier
EP  - 52
VL  - 126
A1  - Boreale, Michele
A1  - De Nicola, Rocco
SP  - 34
TI  - A Symbolic Semantics for the pi-Calculus
ID  - eprints361
AV  - none
IS  - 1
UR  - http://www.sciencedirect.com/science/article/pii/S0890540196900322
ER  -