A Tile-Based Coordination View of Asynchronous pi-Calculus

Tiles are rewrite rules with side effects, reminiscent of both Plotkin SOS and Meseguer rewriting logic rules. They are well suited for modeling coordination languages, since they can be composed both statically and dynamically via possibly complex synchronization and work-flow mechanisms. In this paper, we give a the-based bisimilarity semantics for the asynchronous π-calculus of Honda and Tokoro and prove it equivalent to the ordinary semantics. Two kinds of tiles are provided: activity tiles and coordination tiles. Activity tiles specify the basic interactions sequential processes are able to perform, without considering the operational environment where they live. Instead, coordination tiles control the global evolution of programs.

[1]  Francesca Rossi,et al.  Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization (Extended Abstract) , 1996, COORDINATION.

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

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

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

[5]  Roberto Bruni,et al.  Zero-safe nets, or transition synchronization made simple , 1997, EXPRESS.

[6]  Fabio Gadducci,et al.  A 2-Categorical Presentation of Term Graph Rewriting , 1997, Category Theory and Computer Science.

[7]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[8]  Marko C. J. D. van Eekelen,et al.  Term Graph Rewriting , 1987, PARLE.

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

[10]  R. Street,et al.  Review of the elements of 2-categories , 1974 .

[11]  Fabio Gadducci,et al.  On The Algebraic Approach To Concurrent Term Rewriting , 1996 .

[12]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

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

[14]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[15]  Fabio Gadducci,et al.  Tiles, rewriting rules and CCS , 1996, WRLA.

[16]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[17]  Susan Eisenbach,et al.  Semantics of a Higher-Order Coordination Language , 1996, COORDINATION.

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

[19]  C. Hankin,et al.  Coordination programming: mechanisms, models and semantics , 1996 .

[20]  Zena M. Ariola,et al.  Equational Term Graph Rewriting , 1996, Fundam. Informaticae.

[21]  David Walker,et al.  Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.