Executable tile specifications for process calculi

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

Volumn 1577, Issue , 1999, Pages 60-77

  Bruni, Roberto ^a   Meseguer, José ^b   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATHOLOGY; SEMANTICS; SOFTWARE ENGINEERING; SPECIFICATIONS;

DYNAMIC INTERACTION; EXECUTABLE SPECIFICATIONS; LANGUAGE IMPLEMENTATIONS; MODELING PROCESS; PROCESS CALCULI; REWRITING LOGIC; SIDE EFFECT; SOS FORMATS;

COMPUTER CIRCUITS;

EID: 84947906227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49020-3_5     Document Type: Conference Paper

References (36)

1. B. Bloom, S. Istrail, and A.R. Meyer, Bisimulation can’t be Traced, Journal of the ACM 42(1), 232–268 (1995).
2. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek, ELAN: A logical framework based on computational systems, in [28].
3. R. Bruni, Tile Logic for Synchronized Rewriting of Concurrent Systems, PhD Thesis, Department of Computer Science, University of Pisa, forthcoming.
4. R. Bruni, J. Meseguer, and U. Montanari, Process and Term Tile Logic, Technical Report SRI-CSL-98-06, SRI International (1998)
5. R. Bruni, J. Meseguer, and U. Montanari, Internal Strategies in a Rewriting Implementation of Tile Systems, in [23].
6. R. Bruni, J. Meseguer, and U. Montanari, Implementing Tile Systems: some Examples from Process Calculi, in Proc. ICTCS’98, World Scientific, 168–179 (1998).
7. R. Bruni and U. Montanari, Zero-Safe Nets: Comparing the Collective and the Individual Token Approaches, Information and Computation, to appear.
8. M. Clavel, Reflection in General Logics and in Rewriting Logic with Applications to the Maude Language, PhD Thesis, Universidad de Navarra (1998).
9. M.G. Clavel, F. Duran, S. Eker, P. Lincoln, and J. Meseguer, An Introduction to Maude (Beta Version), SRI International (1998).
10. M. Clavel and J. Meseguer, Reflection and Strategies in Rewriting Logic, in [28].
11. M. Clavel and J. Meseguer, Axiomatizing Reflective Logics and Languages, in Proceedings Reflection’96, San Francisco, USA, 263–288 (1996).
12. M. Clavel and J. Meseguer, Internal Strategies in a Reflective Logic, in Proc. of the CADE-14 Workshop on Strategies in Automated Deduction, 1–12 (1997).
13. G. Denker, J. Meseguer, and C. Talcott, Protocol Specification and Analysis in Maude, in Proc. Workshop on Formal Methods and Security Protocols (1998).
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).
15. G.L. Ferrari and U. Montanari, A Tile-Based Coordination View of Asynchronous Pi-Calculus, in Proc. MFCS’97, Springer LNCS 1295, 52–70 (1997)
16. G.L. Ferrari and U. Montanari, Tiles for Concurrent and Located Calculi, in Proceedings of EXPRESS’97, ENTCS 7 (1997).
17. F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, PhD Thesis TD-96-02, Department of Computer Science, University of Pisa (1996).
18. F. Gadducci and U. Montanari, Enriched Categories as Models of Computations, in Proc. ITCS’95, World Scientific, 1–24 (1996).
19. F. Gadducci and U. Montanari, The Tile Model, in Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, to appear.
20. J.F. Groote, and F. Vaandrager, Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100, 202–260 (1992).
21. K.G. Larsen, and L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Proc. ICALP’90, LNCS 443, 526–539 (1990).
22. F.W. Lawvere, Functorial Semantics of Algebraic Theories, in Proc. National Academy of Science 50, 869–872 (1963).
23. C. Kirchner, H. Kirchner, Ed., Proc. 2nd WRLA’98, ENTCS 15 (1998).
24. N. Martí-Oliet and J. Meseguer, General Logics and Logical Frameworks, in: D. Gabbay, Ed., What is a logical system?, Oxford University Press (1994).
25. N. Martí-Oliet and J. Meseguer, Rewriting Logic as a Logical and Semantic Framework, SRI Technical Report, CSL-93-05 (1993). To appear in D. Gabbay, Ed., Handbook of Philosophical Logic, Kluwer Academic Publishers.
26. J. Meseguer, Conditional Rewriting Logic as a Unified Model of Concurrency, TCS 96, 73–155 (1992)
27. J. Meseguer, Rewriting Logic as a Semantic Framework for Concurrency: A Progress Report, in Proc. CONCUR’96, Springer LNCS 1119, 331-372 (1996).
28. J. Meseguer, Ed., Proc. 1st International Workshop on Rewriting Logic and Applications, ENTCS 4 (1996).
29. J. Meseguer, Membership Equational Logic as a Logical Framework for Equational Specification, in Proc. 12th WADT’ 97. Springer LNCS 1376, 18–61 (1998).
30. J. Meseguer and U. Montanari, Mapping Tile Logic into Rewriting Logic, in Proc. 12th WADT’97, Springer LNCS 1376, 62–91 (1998).
31. J. Meseguer and C. Talcott, Using Rewriting Logic to Interoperate Architectural Description Languages (I and II), Lectures at the Santa Fe and Seattle DARPAEDCS Workshops (1997).
32. R. Milner, Communication and Concurrency, Prentice-Hall (1989).
33. U. Montanari and F. Rossi, Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems, Applied Categorical Structures, to appear.
34. U. Montanari and C. Talcott, Can Actors and pi-Agents Live Together?, in Proceedings HOOTS’97, ENTCS 10 (1998).
35. G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981).
36. P. Viry, Rewriting Modulo a Rewrite System, Technical Report TR-95-20, Department of Computer Science, University of Pisa (1995).