On the Bisimulation Congruence in chi-Calculus

In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under context only at the very beginning. As a result, we show that both in labelled and barbed congruence, the open and closed style definitions coincide. Thus all bisimulation congruences collapse into two equivalences, that is, the well-known open congruence and open barbed congruence, which are the same in the strong case, while in the weak case their difference can be reflected by one axiom. The results of this paper close some conjectures in the literatures and shed light on the algebraic theory of a large class of mobile process calculi.

[1]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

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

[3]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

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

[5]  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).

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

[7]  Yuxi Fu,et al.  Understanding the mismatch combinator in chi calculus , 2003, Theor. Comput. Sci..

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

[9]  Philippa Gardner,et al.  Strong Bisimulation for the Explicit Fusion Calculus , 2004, FoSSaCS.

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

[11]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[12]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[13]  Cédric Fournet,et al.  A hierarchy of equivalences for asynchronous calculi , 1998, J. Log. Algebraic Methods Program..

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

[15]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[16]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[17]  Yuxi Fu Bisimulation congruence of chi calculus , 2003, Inf. Comput..

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

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

[20]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .