Abstract
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.
Research supported in part by CNR Integrated Project Metodi e Strumenti per la Progettazione e la Verifica di Sistemi Eterogenei Connessi mediante Reti di Comunicazione; and Esprit Working Groups CONFER2 and COORDINA. The second author is on leave from Dipartimento di Informatica, Pisa, Italy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio, I. Castellani; D. Sangiorgi, On Bisimulations for the Asynchronous π-calculus. CONCUR'96, LNCS, 1996.
J. Andreoli, C. Hankin, D. Le Metayer (Eds), Coordination Programming: Mechanisms, Models and Semantics, Imperial College Press, 1996.
Z.M. Ariola, J.W. Klop, Equational Term Graph Rewriting, Fundamenta Informaticae 26, 207–240, 1996.
Bruni, R. and Montancri, U., Zero-Safe Nets, or Transition Synchronization Made Simple, to appear in Proc. Express'97, Santa Margherita, September 1997.
H.P. Barendregt, M.C.J.D. van Eekelrn, J.R.W. Glauert J.R. Kennaway. M.J. Plasmeijer, M.R. Sleep, Term Graph Reduction, Proc. PARLE, Springer LNCS 259, 141–158, 1987.
G. Boudol, Asynchrony and the π-calculus (note), Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
N. Carriero, D. Gelenter, Coordination Languages and Their Significance. Communications of the ACM, 35(2), 97–107, 1992
A. Corradini, F. Gadducci, An Algebraic Presentation of Term Graphs via Gs-Monoidal Categories, submitted for publication. Available at http://www.di.unipi.it/ gadducci/papers/aptg.ps, 1997.
A. Corradini, F. Gadducci, A 2-Categorical Presentation of Term Graph Rewriting, Proc. CTCS'97, Springer LNCS, to appear, 1997.
C. Ehresmann, Catégories Structurées: I and II, Ann. Éc. Norm. Sup. 80, Paris (1963), 349–426; III, Topo. et Géo. diff. V, Paris (1963).
F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, PhD Thesis, Universitá di Pisa, Pisa. Technical Report TD-96-02, Department of Computer Science, University of Pisa, 1996.
F. Gadducci, U. Montanari, The Tile Model, Technical Report TR-96-27, Department of Computer Science, University of Pisa, 1996.
F. Gadducci, U. Montanari, Tiles, Rewriting Rules and CCS, in Proc. 1st international workshop on Rewriting Logic and Applications, J. Meseguer Ed., ENTCS 4 (1996), pp.1–19.
K. Honda, M. Tokoro, An Object Calculus for Asynchronous Communication, In: M. Tokoro, O. Nierstrasz, P. Wegner, Eds., Object-Based Concurrent Computing, Springer LNCS 612, 21–51, 1992.
G. Kelly, R. Street, Review of the Elements of 2-categories, Lecture Notes in Mathematics 420, 75–103, 1974.
K.G. Larsen, L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Journal of Logic and Computation, vol. 1, n.6, 1991 (conference version in Proc. ICALP'90, Springer-Verlag, LNCS 443, 1990).
F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proc. National Academy of Science 50, 1963, pp. 869–872.
J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96, 1992, pp. 73–155.
R. Milner, J. Parrow and D. Walker. A calculus of mobile processes (parts I and II). Information and Computation, 100:1–77, 1992.
U. Montanari and F. Rossi, Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization, in: Paolo Ciancarini and Chris Hankin, Eds., Coordination Languages and Models, LNCS 1061, 1996, pp. 12–27. Full paper submitted for publication.
G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
M. Radestock, S. Eisenbach, Semantics of Higher Order Coordination Languages, in Proc. COORDINATION'96, Springer LNCS 1061, 339–356, 1996.
D. Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms. PhD Thesis CST-99-93, University of Edinburgh, 1992.
B. Thomsen. Plain Chocs, Acta Informatica, 30, 1993.
D. Walker. π-calculus semantics for object-oriented programming languages. In Proc. TACS'91. Springer Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrari, G., Montanari, U. (1997). A tile-based coordination view of asynchronous π-calculus. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029949
Download citation
DOI: https://doi.org/10.1007/BFb0029949
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive