Mapping tile logic into rewriting logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1376, Issue , 1998, Pages 62-91

  Meseguer, José ^a   Montanari, Ugo ^b  

^a SRI INTERNATIONAL   (United States)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880351     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64299-4_27     Document Type: Conference Paper

References (40)

1. H.P. Barendregt, M.C.J.D. van Eekelrn, J.R.W. Glauert, J.R. Kermaway, M.J. Plasmeijer, M.R. Sleep, Term Graph Reduction, Proc. PARLE, Springer LNCS 259, 141-158, 1987.
2. A. Bastiani, C. Ehresmann Multiple Functors 1: Limits Relative to Double Categories, Cahiers de Topologie ed Géométrie Diffrrentielle 15 (3), 1974, pp. 545-621.
3. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In Proc. 1st Intl. Workshop on Rewriting Logic and its Applications, ENTCS, North Holland, 1996.
4. G. Boudol, I. Castellani, M. Hermessy, A. Kiehn, Observing Localities, Theoretical Computer Science, 114: 31-61, 1993.
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'9Z Springer LNCS 1214, 1997.
6. R. Bruni, J. Meseguer, and U. Montanari. Process and Term Tile Logic. Technical Report, SRI International, in preparation.
7. R. Brtmi, U. Montanari, Zero-Safe Nets, or Transition Synchronization Made Simple. In: Catuscia Palamidessi, Joachim Parrow, Eds, EXPRESS'97, ENTCS, Vol. 7, 1997.
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.
9. P. Ciancarini, C. Hankin, Eds., Coordination Languages and Models, LNCS 1061, 1996.
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).
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).
12. A. Corradini, F. Gadducci, A P-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.
13. A. Corradini, U. Montanari, An Algebraic Semantics]or Structured Transition Systems and its Application to Logic Programs, Theoretical Computer Science 103, 1992, pp.51-106.
14. C. Ehresmarm, Catggories Structureés: I and II, Ann. Éc. Norm. Sup. 80, Paris (1963), 349-426; III, Topo. et Géo. diff. V, Paris (1963).
15. G. Ferrari, U. Montanari, A Tile. Based Coordination View o] the Asynchronous recalculus. In: Igor Prvara, Peter Ruzicka, Eds., Mathematical Foundations of Computer Science 1997, Springer LNCS 1295, 1997, pp. 52-70.
16. G. Ferrari, U. Montanari, Tilesfor Concurrent and Located Calculi. In: Catuscia Palamidessi, Joachim Pax-row, Eds, EXPRESS'97, ENTCS, Vol. 7.
17. P. Freyd. Algebra valued functors in general and tensor products in particular. Coll. Math., 14:89-106, 1966.
18. K. Futatsugi and T. Sawada. Care as an extensible specification environment. In Proc. of the Kunming International CASE Symposium, Kunming, China, November, 1994.
19. F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, PhD Thesis, Universith di Pisa, Pisa. Technical Report TD-96-02, Department of Computer Science, University of Pisa, 1996.
20. F. Gadducci, U. Montanari, The Tile Model. In: Gordon Plotkin, Colin Stirling, and Mads Tofte, Eels., 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, 1996
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).
22. G.M. Kelly, R.H. Street, Review of the Elements of 2-categories, Lecture Notes in Mathematics 420, 1974, pp. 75-103.
23. C. Lair, Etude Générale de la Catégorie des esqnisses, Esquisses Math. 24 (1974).
24. K.G. Larsen, L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Proc. ICALP'90, LNCS 443, 1990, pp. 526-539.
25. F.W. Lawvere. Some algebraic problems in the context of functorial semantics of algebraic theories. In Proc. Midwest Category Seminar II, pages 41-61. Springer Lecture Notes in Mathematics No. 61, 1968.
26. N. Martí-Oliet, J. Meseguer, Inclusion and Subtypes I: First-order Case, J. Logic Computat., Vol.6 No.3, pp.409-438, 1996.
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.
28. J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science 96, 1992, pp. 73-155.
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.
30. J. Meseguer. Membership algebra. Lecture and abstract at the Dagstuhl Seminar on "Specification and Semantics," July 9, 1996.
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.
32. J. Meseguer, Ed., Procs. Rewriting Logic and Applications, First International Workshop, ENTCS 4 (1996).
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.
34. R. Mihaer, Communication and Concurrency, Prentice-Hall, 1989.
35. R. Milner, J. Parrow, D. Walker, A Calculus of Mobile Processes (parts I and II), Information and Computation, 100:1-77, 1992.
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.
37. B. Pareigis, Categories and Functors, Academic Press, 1970.
38. G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
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.
40. P. Gabriel and F. Ulmer. Lokal präisentierbare Kategorien. Springer Lecture Notes in Mathematics No. 221, 1971.