Tiles, rewriting rules and CCS

Abstract In [12] we introduced the tile model , a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of concurrency theory, and our formalism recollects many properties of these sources. For example, it provides a compositional way to describe both the states and the sequences of transitions performed by a given system, stressing their distributed nature. Moreover, a suitable notion of typed proof allows to take into account also those formalisms relying on the notions of synchronization and side-effects to determine the actual behaviour of a system. In this work we narrow our scope, presenting a restricted version of our tile model and focussing our attention on its expressive power. To this aim, we recall the basic definitions of the process algebras paradigm [3,24], centering the paper on the recasting of this framework in our formalism.

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

[2]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[3]  Gian Luigi Ferrari,et al.  Towards the Unification of Models for Concurrency , 1990, CAAP.

[4]  John Power.  An Abstract Formulation for Rewrite Systems , 1989, Category Theory and Computer Science.

[5]  Ugo Montanari,et al.  An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs , 1992, Theor. Comput. Sci..

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

[7]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Bart Jacobs,et al.  Semantics of Weakening and Contraction , 1994, Ann. Pure Appl. Log..

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

[11]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[12]  Fabio Gadducci,et al.  Relating Two Categorial Models of Term Rewriting , 1995, RTA.

[13]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[14]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[15]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[16]  Fabio Gadducci,et al.  CPO Models for Infinite Term Rewriting , 1995, AMAST.

[17]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[18]  Frits W. Vaandrager,et al.  Turning SOS Rules into Equations , 1994, Inf. Comput..

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

[20]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[21]  Ugo MontanariUniversit.  Enriched Categories as Models of Computation , 1996 .

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

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

[24]  Gonzalo E. Reyes,et al.  Doctrines in Categorical Logic , 1977 .

[25]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[26]  M. J. Plasmeijer,et al.  Term graph rewriting: theory and practice , 1993 .

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

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