A theory of bisimulation for the π-calculus

We study a new formulation of bisimulation for the π-calculus [MPW92], which we have called open bisimulation ( ∼ ). In contrast with the previously known bisimilarity equivalences, ∼ is preserved by all π-calculus operators, including input prefix. The differences among all these equivalences already appear in the sublanguage without name restrictions: Here the definition of ∼ can be factorised into a “standard” part which, modulo the different syntax of actions, is the CCS bisimulation, and a part specific to the π-calculus, which requires name instantiation. Attractive features of ∼ are: A simple axiomatisation (of the finite terms), with a completeness proof which leads to the construction of minimal canonical representatives for the equivalence classes of ∼; an “efficient” characterisation, based on a modified transition system. This characterisation seems promising for the development of automated-verification tools and also shows the call-by-need flavour of ∼. Although in the paper we stick to the π-calculus, the issues developed may be relevant to value-passing calculi in general.

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

[2]  Bent Thomsen,et al.  Calculi for higher order communicating systems , 1990 .

[3]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

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

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

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

[7]  Mogens Nielsen,et al.  A calculus of communicating systems with label passing - ten years after , 1986, Proof, Language, and Interaction.

[8]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[9]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[10]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[11]  Lone Leth.  Functional programs as reconfigurable networks of communicating processes , 1991 .

[12]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

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

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

[15]  Roberto M. Amadio.  A Uniform presentation of chocs and p-calculus , 1991 .

[16]  Action Structures , 1992 .

[17]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[18]  Sebastiano Vigna,et al.  Applications of the Calculus of Trees to Process Description Languages , 1991, Category Theory and Computer Science.

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

[20]  Ugo Montanari,et al.  Dynamic congruence vs. progressing bisimulation for CCS , 1992, Fundam. Informaticae.