%J Information and Computation
%P 34-52
%T A Symbolic Semantics for the pi-Calculus
%R 10.1006/inco.1996.0032
%I Elsevier
%L eprints361
%X 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.
%D 1996
%A Michele Boreale
%A Rocco De Nicola
%N 1
%O 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.
%V 126