The Maude LTL Model Checker and Its Implementation

  • Steven Eker
  • José Meseguer
  • Ambarish Sridharanarayanan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2648)


A model checker typically supports two different levels of specification: (1) a system specification level, in which the concurrent system to be analyzed is formalized; and (2) a property specification level, in which the properties to be model checked—for example, temporal logic formulae—are specified. The Maude LTL model checker has been designed with the goal of combining a very expressive and general system specification language (Maude [1]) with an advanced on-the-fly explicit-state LTL model checking engine.


Model Checker Product Pair Linear Temporal Logic Kripke Structure Negative Normal Form 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Clavel and et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187–243, August 2002.Google Scholar
  2. [2]
    Manuel Clavel and et al. Building equational proving tools by reflection in rewriting logic. In CAFE: An Industrial-Strength Algebraic Formal Method. Elsevier, 2000.Google Scholar
  3. [3]
    Steven Eker and et al. Pathway logic: Executable models of biological networks. In Proc. WRLA’02, volume 71 of ENTCS. Elsevier, 2002.Google Scholar
  4. [4]
    Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proc. WRLA’ 02, volume 71 of ENTCS. Elsevier, 2002.Google Scholar
  5. [5]
    Kousha Etessami and Gerard J. Holzmann. Optimizing Büchi automata. In CONCUR 2000, number 1877 in LNCS, pages 153–167. Springer-Verlag, 2000.CrossRefGoogle Scholar
  6. [6]
    Paul Gastin and Denis Oddoux. Fast LTL to Büchi automata translation. In CAV’ 01, number 2102 in LNCS, pages 53–65. Springer-Verlag, 2001.Google Scholar
  7. [7]
    Rob Gerth and et al. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification Testing and Verification, pages 3–18. Chapman & Hall, 1995.Google Scholar
  8. [8]
    G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. Design: An International Journal, 13(3):289–307, nov 1998.Google Scholar
  9. [9]
    José Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In CAV’ 00, number 1633 in LNCS, pages 247–263. Springer-Verlag, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Steven Eker
    • 1
  • José Meseguer
    • 2
  • Ambarish Sridharanarayanan
    • 2
  1. 1.Computer Science LaboratorySRI InternationalMenlo Park
  2. 2.CS DepartmentUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations