Skip to main content
Springer Nature Link
Log in

Theoroidal Maps as Algebraic Simulations

  • Conference paper
Recent Trends in Algebraic Development Techniques (WADT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3423))

Included in the following conference series:

  • 237 Accesses

Abstract

Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framework in which to formally specify these mathematical models, and introduce a particular and elegant way of representing simulations in it: theoroidal maps. A categorical viewpoint is very natural in the study of these structures and we show how to organize Kripke structures in categories that afterwards are lifted to the rewriting logic’s level. We illustrate the use of theoroidal maps with two applications: predicate abstraction and the study of fairness constraints.

Research supported by ONR Grant N00014-02-1-0715, NSF Grant CCR-0234524, and by DARPA through Air Force Research Laboratory Contract F30602-02-C-0130; and by the Spanish projects MELODIAS TIC 2002-01167 and MIDAS TIC 2003–0100.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Arrais, M., Fiadeiro, J.L.: Unifying theories in different institutions. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 81–101. Springer, Heidelberg (1996)

    Google Scholar 

  2. Barr, M., Wells, C.: Category Theory for Computing Science, 3rd edn. Centre de Recherches Mathématiques (1999)

    Google Scholar 

  3. Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science 285(2), 155–185 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bruni, R., Meseguer, J.: Generalized rewrite theories. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 252–266. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  6. Clavel, M.: The ITP Tool (2004), http://geminis.sip.ucm.es/~clavel/itp

  7. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285(2), 187–243 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude manual, version 2.1 (2004), http://maude.cs.uiuc.edu/manual/

  9. Colón, M.A., Uribe, T.E.: Generating finite-state abstractions of reactive systems using decision procedures. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 293–304. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL model checker. In: Gadducci, F., Montanari, U. (eds.) Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002. ENTCS, vol. 71. Elsevier, Amsterdam (2002)

    Google Scholar 

  11. Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific, Singapore (1998)

    MATH  Google Scholar 

  12. Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)

    MATH  MathSciNet  Google Scholar 

  13. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Google Scholar 

  14. Martí-Oliet, N., Meseguer, J.: Rewriting logic: Roadmap and bibliography. Theoretical Computer Science 285(2), 121–154 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Martí-Oliet, N., Meseguer, J., Palomino, M.: Algebraic simulations (2004), http://maude.cs.uiuc.edu/papers/

  16. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. 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)

    Google Scholar 

  18. Meseguer, J.: Localized fairness: a rewriting semantics (2004) (Paper in preparation)

    Google Scholar 

  19. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 2–16. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Tarlecki, A., Burstall, R.M., Goguen, J.A.: Some fundamental algebraic tools for the semantics of computation. Part 3: Indexed categories. Theoretical Computer Science 91(2), 239–264 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos, Universidad Complutense de Madrid,  

    Narciso Martí-Oliet & Miguel Palomino

  2. Computer Science Department, University of Illinois at Urbana-Champaign,  

    José Meseguer

Authors
  1. Narciso Martí-Oliet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel Palomino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    José Luiz Fiadeiro

  2. Department of Computer Science, Swansea University, UK

    Peter D. Mosses

  3. Dpto de L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034, Barcelona, Spain

    Fernando Orejas

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martí-Oliet, N., Meseguer, J., Palomino, M. (2005). Theoroidal Maps as Algebraic Simulations. In: Fiadeiro, J.L., Mosses, P.D., Orejas, F. (eds) Recent Trends in Algebraic Development Techniques. WADT 2004. Lecture Notes in Computer Science, vol 3423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31959-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31959-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25327-3

  • Online ISBN: 978-3-540-31959-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics