Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi

We study reduction congruence, the most widely used notion of equality for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous π-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semantics-preserving way.

[1]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[2]  James Riely,et al.  Distributed processes and location failures , 2001, Theor. Comput. Sci..

[3]  Matthew Hennessy.  Timed Process Algebras: A Tutorial , 1992, NATO ASI PDC.

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

[5]  Peter Sewell,et al.  Nomadic Pict: language and infrastructure design for mobile agents , 2000, IEEE Concurr..

[6]  Kohei Honda,et al.  Sequentiality and the π-Calculus , 2001 .

[7]  Heinrich Müller,et al.  Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung, Dagstuhl Seminar 1997 , 1999, Effiziente Methoden der geometrischen Modellierung und der wissenschaftlichen Visualisierung.

[8]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[9]  R. Amadio,et al.  Localities and Failures , 1995 .

[10]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[11]  Michael D. Myjak,et al.  Time Synchronization Server , 1995 .

[12]  Peter Sewell.  Global/Local Subtyping and Capability Inference for a Distributed pi-calculus , 1998, ICALP.

[13]  Paweł T. Wojciechowski,et al.  Nomadic Pict: language and infrastructure design for mobile computation , 2000 .

[14]  Martin Friedrich Berger.  Towards abstractions for distributed systems , 2003 .

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

[16]  Nobuko Yoshida,et al.  A uniform type structure for secure information flow , 2002, POPL '02.

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

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

[19]  Chris Hankin,et al.  Coordinatio Languages and Models , 2002, Lecture Notes in Computer Science.

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

[21]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

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

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

[24]  Julian Bradfield.  CONCUR '96: Concurrency Theory , 1996 .

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

[26]  Nobuko Yoshida,et al.  Genericity and the π-calculus , 2005, Acta Informatica.

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

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

[29]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[30]  Oscar Nierstrasz,et al.  Object-Based Concurrent Computing , 1991, Lecture Notes in Computer Science.