Synchronous Products of Rewrite Systems

  • Óscar MartínEmail author
  • Alberto Verdejo
  • Narciso Martí-Oliet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9938)


We present a concept of module composition for rewrite systems that we call synchronous product, and also a corresponding concept for doubly labeled transition systems (as proposed by De Nicola and Vaandrager) used as semantics for the former. In both cases, synchronization happens on states and on transitions, providing in this way more flexibility and more natural specifications. We describe our implementation in Maude, a rewriting logic-based language and system. A series of examples shows their use for modular specification and hints at other possible uses, including modular verification.


Mutual Exclusion Atomic Proposition Label Transition System Kripke Structure Behavioral Programming 
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.


  1. 1.
    Balland, E., Brauner, P., Kopetz, R., Moreau, P.-E., Reilles, A.: Tom: piggybacking rewriting on Java. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 36–47. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.E.: ELAN from a rewriting logic point of view. Theor. Comput. Sci. 285(2), 155–185 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2001)CrossRefGoogle Scholar
  4. 4.
    Clarke, E.M., Long, D., McMillan, K.: Compositional model checking. In: Proceedings of Logic in Computer Science, LICS 1989, pp. 353–362 (1989)Google Scholar
  5. 5.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  6. 6.
    De Nicola, R., Fantechi, A., Gnesi, S., Ristori, G.: An action-based framework for verifying logical and behavioural properties of concurrent systems. Comput. Netw. ISDN Syst. 25(7), 761–778 (1993)CrossRefzbMATHGoogle Scholar
  7. 7.
    De Nicola, R., Vaandrager, F.: Three logics for branching bisimulation. J. ACM 42(2), 458–487 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 407–419. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  9. 9.
    Durán, F., Meseguer, J.: The Maude specification of Full Maude (1999). Manuscript, Computer Science Laboratory, SRI International.
  10. 10.
    Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gadducci, F., Montanari, U. (eds.) Proceedings of WRLA 2002. (Electron. Notes Theor. Comput. Sci. 71, 162–187 (2004). Elsevier)Google Scholar
  11. 11.
    Escobar, S., Meseguer, J.: Symbolic model checking of infinite-state systems using narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153–168. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Harel, D., Lampert, R., Marron, A., Weiss, G.: Model-checking behavioral programs. In: Proceedings of EMSOFT 2011. ACM (2011)Google Scholar
  13. 13.
    Harel, D., Marron, A., Weiss, G.: Behavioral programming. Commun. ACM 55(7), 90–100 (2012)CrossRefGoogle Scholar
  14. 14.
    Kindler, E., Vesper, T.: ESTL: a temporal logic for events and states. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 365–384. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  15. 15.
    Kirchner, H.: Rewriting strategies and strategic rewrite programs. In: Martí-Oliet, N., Ölveczky, P.C., Talcott, C. (eds.) Meseguer Festschrift. LNCS, vol. 9200, pp. 380–403. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  16. 16.
    Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to modular model checking. ACM Trans. Program. Lang. Syst. 22(1), 87–128 (2000)CrossRefzbMATHGoogle Scholar
  17. 17.
    Martí-Oliet, N., Meseguer, J., Verdejo, A.: A rewriting semantics for Maude strategies. In: Roşu, G. (ed.) Proceedings of WRLA 2008. (Electron. Notes Theor. Comput. Sci. 238(3), 227–247 (2009). Elsevier)Google Scholar
  18. 18.
    Martín, Ó., Verdejo, A., Martí-Oliet, N.: Egalitarian state-transition systems. In: Lucanu, D. (ed.) WRLA 2016. LNCS, vol. 9942, pp. 98–117. Springer, Heidelberg (2016)CrossRefGoogle Scholar
  19. 19.
    Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comput. Sci. 96(1), 73–155 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  21. 21.
    Meseguer, J.: The temporal logic of rewriting: a gentle introduction. In: Degano, P., Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 354–382. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  22. 22.
    Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)zbMATHGoogle Scholar
  23. 23.
    Plump, D.: The design of GP 2. In: Escobar, S. (ed.) Proceedings of WRS 2011. (Electron. Proc. Theor. Comput. Sci. 82, 1–16 (2011))Google Scholar
  24. 24.
    Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundam. Inform. 118(1–2), 135–175 (2012)MathSciNetzbMATHGoogle Scholar
  25. 25.
    Roldán, M., Durán, F., Vallecillo, A.: Invariant-driven specifications in Maude. Sci. Comput. Program. 74(10), 812–835 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Visser, E.: A survey of rewriting strategies in program transformation systems. In: WRS 2001 (Electron. Notes Theor. Comput. Sci. 57, 109–143 (2001))Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Óscar Martín
    • 1
  • Alberto Verdejo
    • 1
  • Narciso Martí-Oliet
    • 1
  1. 1.Facultad de InformáticaUniversidad Complutense de MadridMadridSpain

Personalised recommendations