Advertisement

Mapping tile logic into rewriting logic

  • José Meseguer
  • Ugo Montanari
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1376)

Abstract

Rewriting logic extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation efforts (Cafe, ELAN, Maude). Tile logic extends (unconditional) rewriting logic since it takes into account state changes with side effects and synchronization. It is especially useful for defining compositional models of computation of reactive systems, coordination languages, mobile calculi, and causal and located concurrent systems. In this paper, the two logics are defined and compared using a recently developed algebraic specification methodology, membership equational logic. Given a theory T, the rewriting logic of T is the free monoidal 2-category, and the tile logic of T is the free monoidal double category, both generated by T. An extended version of monoidal 2-categories, called 2VH-categories, is also defined, able to include in an appropriate sense the structure of monoidal double categories. We show that 2VH-categories correspond to an extended version of rewriting logic, which is able to embed tile logic, and which can be implemented in the basic version of rewriting logic using suitable internal strategies. These strategies can be significantly simpler when the theory is uniform. A uniform theory is provided in the paper for CCS, and it is conjectured that uniform theories exist for most process algebras.

Keywords

Monoidal Category Process Algebra Forgetful Functor Partial Algebra Signature Morphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H.P. Barendregt, M.C.J.D. van Eekern, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Term Graph Reduction, Proc. PARLE, Springer LNCS 259, 141–158, 1987.Google Scholar
  2. 2.
    A. Bastiani, C. Ehresmann Multiple Functors I: Limits Relative to Double Categories, Cahiers de Topologie ed Geometrie Differentielle 15 (3), 1974, pp. 545–621.Google Scholar
  3. 3.
    P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In Proc. 1 st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.Google Scholar
  4. 4.
    G. Boudol, I. Castellani, M. Hennessy, A. Kiehn, Observing Localities, Theoretical Computer Science, 114:31–61, 1993.Google Scholar
  5. 5.
    Adel Bouhoula, Jean-Pierre Jouannaud, and José Meseguer. Specification and proof in membership equational logic. In M. Bidoit and M. Dauchet, editors, Proceedings of TAPSOFT'97. Springer LNCS 1214, 1997.Google Scholar
  6. 6.
    R. Bruni, J. Meseguer, and U. Montanari. Process and Term Tile Logic. Technical Report, SRI International, in preparation.Google Scholar
  7. 7.
    R. Bruni, U. Montanari, Zero-Safe Nets, or Transition Synchronization Made Simple. In: Catuscia Palamidessi, Joachim Parrow, Eds, EXPRESS'97, ENTCS, Vol. 7, 1997.Google Scholar
  8. 8.
    R. Bruni, U. Montanari, Zero-Safe Nets: The Individual Token Approach. In: Francesco Parisi-Presicce, Ed., Proc. 12th WADT Workshop on Algebraic Development Techniques, Spinger LNCS, 1998, this volume.Google Scholar
  9. 9.
    P. Ciancarini, C. Hankin, Eds., Coordination Languages and Models, LNCS 1061, 1996.Google Scholar
  10. 10.
    Manuel G. Clavel, Steven Eker, Patrick Lincoln, and José Meseguer. Principles of Maude. In: J. Meseguer, Guest Ed., First International Workshop on Rewriting Logic and its Applications, ENTCS 4 (1996).Google Scholar
  11. 11.
    M. Clavel, J. Meseguer, Internal Strategies in a Reflective Logic. In: J. Meseguer, Guest Ed., First International Workshop on Rewriting Logic and its Applications, ENTCS 4 (1996).Google Scholar
  12. 12.
    A. Corradini, F. Gadducci, A 2-Categorical Presentation of Term Graph Rewriting. In: Eugenio Moggi, Giuseppe Rosolini, Eds., Category Theory and Computer Science 1997, Springer LNCS 1290, 1997, pp.87–105.Google Scholar
  13. 13.
    A. Corradini, U. Montanari, An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs, Theoretical Computer Science 103, 1992, pp.51–106.Google Scholar
  14. 14.
    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).Google Scholar
  15. 15.
    G. Ferrari, U. Montanari, A Tile-Based Coordination View of the Asynchronous π-calculus. In: Igor Prvara, Peter Ruzicka, Eds., Mathematical Foundations of Computer Science 1997, Springer LNCS 1295, 1997, pp. 52–70.Google Scholar
  16. 16.
    G. Ferrari, U. Montanari, Tiles for Concurrent and Located Calculi. In: Catuscia Palamidessi, Joachim Parrow, Eds, EXPRESS'97, ENTCS, Vol. 7.Google Scholar
  17. 17.
    P. Freyd. Algebra valued functors in general and tensor products in particular. Coll. Math., 14:89–106, 1966.Google Scholar
  18. 18.
    K. Futatsugi and T. Sawada. Cafe as an extensible specification environment. In Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    F. Gadducci, U. Montanari, The Tile Model. In: Gordon Plotkin, Colin Stirling, and Mads Tofte, Eds., Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, to appear. Also Technical Report TR-96-27, Department of Computer Science, University of Pisa, 1996Google Scholar
  21. 21.
    F. Gadducci, U. Montanari, Tiles, Rewriting Rules and CCS. In: J. Meseguer, Guest Ed., 1st Int. Workshop on Rewriting Logic and its Applications, ENTCS 4 (1996).Google Scholar
  22. 22.
    G.M. Kelly, R.H. Street, Review of the Elements of 2-categories, Lecture Notes in Mathematics 420, 1974, pp. 75–103.Google Scholar
  23. 23.
    C. Lair, Etude Générale de la Catégorie des esquisses, Esquisses Math. 24 (1974).Google Scholar
  24. 24.
    K.G. Larsen, L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Proc. ICALP'90, LNCS 443, 1990, pp. 526–539.Google Scholar
  25. 25.
    F.W. Lawvere. Some algebraic problems in the context of Fnctorial semantics of algebraic theories. In Proc. Midwest Category Seminar II, pages 41–61. Springer Lecture Notes in Mathematics No. 61, 1968.Google Scholar
  26. 26.
    N. Marti-Oliet, J. Meseguer, Inclusion and Subtypes I: First-order Case, J. Logic Computat., Vol.6 No.3, pp.409–438, 1996.Google Scholar
  27. 27.
    J. Meseguer, Rewriting as a Unified Model of Concurrency, SRI Technical Report, CSL-93-02R, 1990. See the appendix on Functorial Semantics of Rewrite Systems.Google Scholar
  28. 28.
    J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96, 1992, pp. 73–155.CrossRefGoogle Scholar
  29. 29.
    J. Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Gul Agha, Peter Wegner, and Akinori Yonezawa, Eds., Research Directions in Concurrent Object-Oriented Programming, pp. 314–390. MIT Press, 1993.Google Scholar
  30. 30.
    J. Meseguer. Membership algebra. Lecture and abstract at the Dagstuhl Seminar on “Specification and Semantics,” July 9, 1996.Google Scholar
  31. 31.
    J. Meseguer, Rewriting Logic as a Semantic Framework for Concurrency: A Progress Report, in: U. Montanari and V. Sassone, Eds., CONCUR'96: Concurrency Theory, Springer LNCS 1119, 1996, 331–372.Google Scholar
  32. 32.
    J. Meseguer, Ed., Procs. Rewriting Logic and Applications, First International Workshop, ENTCS 4 (1996).Google Scholar
  33. 33.
    J. Meseguer, Membership Equational Logic as a Logical Framework for Equational Specification. In: Francesco Parisi-Presicce, Ed., Proc. 12th WADT Workshop on Algebraic Development Techniques, Spinger LNCS, 1998, this volume.Google Scholar
  34. 34.
    R. Milner, Communication and Concurrency, Prentice-Hall, 1989.Google Scholar
  35. 35.
    R. Milner, J. Parrow, D. Walker, A Calculus of Mobile Processes (parts I and II), Information and Computation, 100:1–77, 1992.CrossRefGoogle Scholar
  36. 36.
    U. Montanari, 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.Google Scholar
  37. 37.
    B. Pareigis, Categories and Functors, Academic Press, 1970.Google Scholar
  38. 38.
    G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  39. 39.
    A. Poigné. Algebra categoricaly. In D. Pitt et al., editor, Category Theory and Computer Programming, volume 240 of LNCS, pages 76–102. Springer-Verlag, 1985.Google Scholar
  40. 40.
    P. Gabriel and F. Ulmer. Lokal präsentierbare Kategorien. Springer Lecture Notes in Mathematics No. 221, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • José Meseguer
    • 1
  • Ugo Montanari
    • 2
  1. 1.Computer Science Laboratory, SRI InternationalMenlo Park
  2. 2.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations