The Maude LTL Model Checker and Its Implementation
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 ) with an advanced on-the-fly explicit-state LTL model checking engine.
KeywordsModel Checker Product Pair Linear Temporal Logic Kripke Structure Negative Normal Form
Unable to display preview. Download preview PDF.
- M. Clavel and et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187–243, August 2002.Google Scholar
- 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
- Steven Eker and et al. Pathway logic: Executable models of biological networks. In Proc. WRLA’02, volume 71 of ENTCS. Elsevier, 2002.Google Scholar
- Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proc. WRLA’ 02, volume 71 of ENTCS. Elsevier, 2002.Google Scholar
- 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
- 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
- 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
- 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