Bisimulations in the join-calculus

We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact of the lexical scope discipline of the join-calculus on its extensional semantics. We propose several formulations of bisimulation and establish that all formulations yield the same equivalence. We prove that this equivalence is finer than barbed congruence, but that both relations coincide in the presence of name matching. Copyright 2001 Elsevier Science B.V.

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

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

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

[4]  Uwe Nestmann.  On the Expressive Power of Joint Input , 1998, EXPRESS.

[5]  Rocco De Nicola,et al.  Proof techniques for cryptographic processes , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

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

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

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

[9]  Björn Victor,et al.  Concurrent Constraints in the Fusion Calculus , 1998 .

[10]  Daniel Le Métayer,et al.  The GAMMA Model and Its Discipline of Programming , 1990, Sci. Comput. Program..

[11]  Faron Mollerz,et al.  The Mobility Workbench | a Tool for the -calculus | , 1994 .

[12]  Davide Sangiorgi,et al.  Bisimulation in name-passing calculi without matching , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[13]  Glynn Winskel,et al.  Proceedings of the 25th International Colloquium on Automata, Languages and Programming , 1998 .

[14]  Cosimo Laneve,et al.  Implicit Typing à la ML for the Join-Calculus , 1997, CONCUR.

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

[16]  Marco Pistore,et al.  Checking Bisimilarity for Finitary pi-Calculus , 1995, CONCUR.

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

[18]  Cosimo Laneve.  May and Must Testing in the Join-Calculus , 1996 .

[19]  Roberto M. Amadio.  An Asynchronous Model of Locality, Failurem and Process Mobility , 1997, COORDINATION.

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

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

[22]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[23]  Davide Sangiorgi.  The Name Discipline of Uniform Receptiveness (Extended Abstract) , 1997, ICALP.

[24]  James Riely,et al.  Distributed Processes and Location Failures (Extended Abstract) , 1997, ICALP.

[25]  Antoni Mazurkiewicz,et al.  Proceedings of the 8th International Conference on Concurrency Theory , 1997 .

[26]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[27]  Martín Abadi,et al.  Secure implementation of channel abstractions , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

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

[29]  Ugo Montanari,et al.  Proceedings of the 7th International Conference on Concurrency Theory , 1996 .

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

[31]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[32]  Cédric Fournet,et al.  A Hierarchy of Equivalences for Asynchronous Calculi , 1998, ICALP.

[33]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[34]  Davide Sangiorgi.  The Name Discipline of Uniform Receptiveness , 1999, Theor. Comput. Sci..

[35]  Martín Abadi,et al.  Authentication primitives and their compilation , 2000, POPL '00.

[36]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[37]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[38]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[39]  Faron Moller,et al.  The Mobility Workbench - A Tool for the pi-Calculus , 1994, CAV.

[40]  Sylvain Conchon,et al.  Jocaml: mobile agents for Objective-Caml , 1999, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents.

[41]  Cosimo Laneve,et al.  Bisimulations in the join-calculus , 1998 .

[42]  J. Parrow,et al.  Multiway Synchronization Veriied with Coupled Simulation , 1992 .