Executable Tile Specifications for Process Calculi

Tile logic extends rewriting logic by taking into account side-effects and rewriting synchronization. These aspects are very important when we model process calculi, because they allow us to express the dynamic interaction between processes and “the rest of the world”. Since rewriting logic is the semantic basis of several language implementation efforts, we can define an executable specification of tile systems by mapping tile logic back into rewriting logic. In particular, this implementation requires the development of a metalayer to control rewritings, i.e., to discard computations that do not correspond to any deduction in tile logic. Our methodology is applied to term tile systems that cover and extend a wide-class of SOS formats for the specification of process calculi. The case study of full CCS, where the term tile format is needed to deal with recursion (in the form of the replicator operator), is discussed in detail.

[1]  José Meseguer,et al.  Mapping tile logic into rewriting logic , 1997, WADT.

[2]  P. Viry Rewriting modulo a rewrite system , 1995 .

[3]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[4]  José Meseguer,et al.  General logics and logical frameworks , 1994 .

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

[6]  Igor Prívara,et al.  Mathematical Foundations of Computer Science 1997 , 1997, Lecture Notes in Computer Science.

[7]  Jan Friso Groote,et al.  Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[8]  Hélène Kirchner,et al.  ELAN: A logical framework based on computational systems , 1996, WRLA.

[9]  Gian Luigi Ferrari,et al.  Tiles for concurrent and located calculi? , 1999, EXPRESS.

[10]  Ugo Montanari,et al.  Can Actors and pi-Agents Live Together? , 1998, HOOTS.

[11]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[12]  M. Clavel Reflection in general logics and in rewriting logic with applications to the maude languaje , 1998 .

[13]  J. Meseguer,et al.  Process and Term Tile Logic , 1998 .

[14]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

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

[16]  Xinxin Liu,et al.  Compositionality through an Operational Semantics of Contexts , 1990, Journal of Logic and Computation.

[17]  José Meseguer,et al.  Reflection and strategies in rewriting logic , 1996, WRLA.

[18]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[19]  Fabio Gadducci,et al.  Enriched Categories as Models of Computation , 1995 .

[20]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

[21]  Francesca Rossi,et al.  Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems , 1999, Appl. Categorical Struct..

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

[23]  Gian Luigi Ferrari,et al.  A Tile-Based Coordination View of Asynchronous pi-Calculus , 1997, MFCS.

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

[25]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

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

[27]  D. Gabbay What is a logical system , 1994 .

[28]  R. Bruni Tile Logic for Synchronized Rewriting of Concurrent Systems , 1999 .

[29]  Roberto Bruni,et al.  Internal strategies in a rewriting implementation of tile systems , 1998, WRLA.