%0 Journal Article
%@ 0890-5401
%A Boreale, Michele
%A De Nicola, Rocco
%D 1996
%F eprints:361
%I Elsevier
%J Information and Computation
%N 1
%P 34-52
%T A Symbolic Semantics for the pi-Calculus
%U http://eprints.imtlucca.it/361/
%V 126
%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.
%Z 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.