Bisimulations for Asynchronous Mobile Processes

Within the past few years there has been renewed interest in the study of value-passing process calculi as a consequence of the emergence of the pi-calculus. Here, [MPW89] have determined two variants of the notion of bisimulation, late and early bisimilarity. Most recently [San93] has proposed the new notion of open bisimulation equivalence. In this paper we consider Plain LAL, a mobile process calculus which differs from the pi-calculus in the sense that the communication of data values happens asynchronously. The surprising result is that in the presence of asynchrony, the open, late and early bisimulation equivalences coincide - this in contrast to the pi-calculus where they are distinct. The result allows us to formulate a common equational theory which is sound and complete for finite terms of Plain LAL.

[1]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[2]  Arne Skou,et al.  Specification and Automated Verification of Real-Time Behaviour —A Case Study , 1996 .

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

[4]  Robin Milner,et al.  A semantics for ML concurrency primitives , 1992, POPL '92.

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

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

[7]  Josva Kleist,et al.  Process Calculi with Asynchronous Communication , 1994 .

[8]  David Gelernter,et al.  Distributed communication via global buffer , 1982, PODC '82.

[9]  Josva Kleist,et al.  Process Calculi with Asynchronous Communication: Master's Thesis , 1994 .

[10]  R. Cramer,et al.  Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .

[11]  Anna Ingólfsdóttir,et al.  Late and Early Semantics Coincide for Testing , 1995, Theor. Comput. Sci..

[12]  Jaap van Oosten.  The modified realizability topos , 1997 .

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

[14]  Martin Odersky,et al.  Applying pi: towards a basis for concurrent imperative programming , 1996 .

[15]  Ivan Damgård,et al.  Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.

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

[17]  K. V. S. Prasad,et al.  A Machine Verified Distributed Sorting Algorithm , 1996 .

[18]  Thore Husfeldt,et al.  A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth , 1996 .

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

[20]  Kim G. Larsen,et al.  The Fork Calculus , 1993, Nord. J. Comput..

[21]  Mogens Nielsen,et al.  Open Maps, Behavioural Equivalences, and Congruences , 1996, Theor. Comput. Sci..

[22]  M. Goldberg.  An Adequate Left-Associated Binary Numeral System in the-Calculus ( Revised Version ) , 1995 .