Tau laws for pi calculus

The paper investigates the nonsymbolic algebraic semantics of the weak bisimulation congruences on finite pi processes. The weak bisimulation congruences are studied both in the absence and in the presence of the mismatch operator. Some interesting phenomena about the open congruences are revealed. Several new tau laws are discovered and their relationship is discussed. The contributions of the paper are mainly as follows: 1. It is proved that Milner's three tau laws fail to lift a complete system for the strong open congruence to a complete system for the weak open congruence in the absence of both the mismatch operator and the restriction operator. A fourth tau law is proposed to deal with the match operator under the prefix operation. It is shown that for this calculus a complete system for the strong open congruence extended with all the four tau laws is complete for the weak open congruence. 2. It is verified that the four tau laws are also enough for the weak open congruence of the pi calculus without the mismatch operator. A complete system using distinctions is given. 3. It is pointed out that the standard definition of the weak open congruence gives rise to a bad equivalence relation in the presence of the mismatch operator. Two alternatives are proposed. These are the late open congruence and the early open congruence. Their difference is similar to that between the weak late congruence and the weak early congruence. Complete axiomatic systems for the two weak open congruences are given.

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

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

[3]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.

[4]  Davide Sangiorgi pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[5]  D. Sangiorgi - calculus , internal mobility , and agent-passing calculi , 1995 .

[6]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[7]  Yuxi Fu,et al.  Chi Calculus with Mismatch , 2000, CONCUR.

[8]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[9]  Huimin Lin Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus , 1998, ICALP.

[10]  Roberto M. Amadio,et al.  Modelling IP Mobility , 1998, Formal Methods Syst. Des..

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

[12]  Yuxi Fu Open Bisimulations on Chi Processes , 1999, CONCUR.

[13]  Davide Sangiorgi,et al.  On Asynchrony in Name-Passing Calculi , 1998, ICALP.

[14]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

[15]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

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

[17]  Yuxi Fu,et al.  Variations on Mobile Processes , 1999, Theor. Comput. Sci..

[18]  Michele Boreale,et al.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1996, Theor. Comput. Sci..

[19]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

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

[21]  Yuxi Fu,et al.  The Ground Congruence for Chi Calculus , 2000, FSTTCS.

[22]  E. Keith Lloyd,et al.  Reaction Graphs , 1998 .

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

[24]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[25]  Yuxi Fu Bisimulation Lattice of Chi Processes , 1998, ASIAN.

[26]  Michele Boreale On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1998, Theor. Comput. Sci..

[27]  Bent Thomsen A Theory of Higher Order Communicating Systems , 1995, Inf. Comput..

[28]  Yuxi Fu A Proof Theoretical Approach to Communication , 1997, ICALP.

[29]  Davide Sangiorgi,et al.  Some Congruence Properties for Pi-Calculus Bisimilarities , 1998, Theor. Comput. Sci..

[30]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[31]  Fu Yu An Open Problem of Mobile Processes , 2001 .

[32]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[34]  Fu Yuxi Testing congruence for mobile processes , 2002 .

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

[36]  Huimin Lin Complete inference systems for weak bisimulation equivalences in the pi-calculus , 2003, Inf. Comput..

[37]  Davide Sangiorgi,et al.  On Barbed Equivalences in pi-Calculus , 2001, CONCUR.

[38]  Yuxi Fu The x-Calculus , 1997, APDC.

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

[40]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[41]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[42]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[43]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.

[44]  Björn Victor,et al.  The Update Calculus (Extended Abstract) , 1997, AMAST.

[45]  Yuxi Fu The /spl chi/-calculus , 1997, Proceedings. Advances in Parallel and Distributed Computing.

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

[47]  C. K. R. T. Jones,et al.  The ϱ-Calculus , 1981, Math. Log. Q..

[48]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[49]  Davide Sangiorgi,et al.  On asynchrony in name-passing calculi , 1998, Mathematical Structures in Computer Science.

[50]  Huimin Lin,et al.  Unique Fixpoint Induction for Mobile Processes , 1995, CONCUR.

[51]  Cheng-Shang Chang Calculus , 2020, Bicycle or Unicycle?.

[52]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[53]  Fu Yu-xi A schematic axiom for open congruence , 2005 .