A Symbolic Semantics for the pi-calculus (Extended Abstract)

Symbolic transition systems are used as a basis for giving a new semantics of the π-calculus. This semantics is more amenable to automatic manipulation and sheds new light on the logical differences among different forms of bisimulation over dynamic process algebras. Symbolic transitions have the form Pϕ,αP, where, intuitively, φ is a boolean constraint over names that has to hold for the transition to take place, and α is a π-calculus action; e.g., [x=y]α.P[x=y]α P says that action α can be performed under any interpretation of names satisfying x=y. A symbolic bisimulation is defined on top of the symbolic transition system and it is shown that it captures the standard ones. Finally, a complete proof system is defined for symbolic bisimulation.

[1]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1993, Inf. Comput..

[2]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[3]  Rocco De Nicola,et al.  A Symbolic Semantics for the pi-Calculus , 1996, Inf. Comput..

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes (Extended Abstract) , 1992, CONCUR.

[6]  Mads Dam Model Checking Mobile Processes , 1993, CONCUR.

[7]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..