A Symbolic Semantics for the pi-Calculus

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 formformula], 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.

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

[2]  Gian Luigi Ferrari,et al.  A Pi-Calculus with Explicit Substitutions , 1996, Theor. Comput. Sci..

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

[4]  Rocco De Nicola,et al.  A Symbolic Semantics for the π-calculus , 1994 .

[5]  Matthew Hennessy,et al.  Proof Systems for Message-Passing Process Algebras , 1993, CONCUR.

[6]  H. Lin.  Symbolic Bisimulations and Proof Systems for the , 1994 .

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

[8]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

[9]  Bengt Jonsson,et al.  Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs , 1989, STACS.

[10]  Rocco De Nicola,et al.  A Symbolic Semantics for the pi-calculus (Extended Abstract) , 1994 .

[11]  Huimin Lin.  Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus , 1995, TAPSOFT.

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

[13]  M Hennessy.  A Model for the -calculus , 1991 .

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

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

[16]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes , 1995, Inf. Comput..

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