An Asynchronous Model of Locality, Failurem and Process Mobility

We present a model of distributed computation which is based on a fragment of the π-calculus relying on asynchronous communication. We enrich the model with the following features: the explicit distribution of processes to locations, the failure of locations and their detection, and the mobility of processes. Our contributions are two folds. At the specification level, we give a synthetic and flexible formalization of the features mentioned above. At the verification level, we provide original methods to reason about the bisimilarity of processes in the presence of failures.

[1]  Joe Armstrong,et al.  Concurrent programming in ERLANG , 1993 .

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

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

[4]  Gérard Boudol,et al.  Some Chemical Abstract Machines , 1993, REX School/Symposium.

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

[6]  Lone Leth Thomsen,et al.  From a Concurrent Lambda-Calculus to the Pi-Calculus , 1995, FCT.

[7]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[8]  Joyce Farrell.  Java Programming , 1999 .

[9]  John H. Reppy,et al.  CML: A Higher-Order Concurrent Language , 1991, PLDI.

[10]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[11]  Elena Zucca,et al.  Parametric Channels via Label Expressions in CCS , 1984, Theor. Comput. Sci..

[12]  Davide Sangiorgi.  Internal Mobility and Agent-Passing Calculi , 1995, ICALP.

[13]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1996, POPL '96.

[15]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

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

[17]  Hagit Attiya,et al.  Renaming in an asynchronous environment , 1990, JACM.

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

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

[20]  Luca Cardelli,et al.  Obliq, a language with distributed scope , 1996 .

[21]  Ken Arnold,et al.  The Java Programming Language , 1996 .

[22]  Tomasz Janowski,et al.  Bisimulation and Fault-Tolerance , 1995 .

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

[24]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

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

[27]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .