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 P θ, α→ P′, 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. © 1996 Academic Press, Inc.
A Symbolic Semantics for the pi-Calculus
DE NICOLA R;
1996-01-01
Abstract
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 P θ, α→ P′, 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. © 1996 Academic Press, Inc.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.