Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL

  • Alexander Schimpf
  • Stephan Merz
  • Jan-Georg Smaus
Conference paper

DOI: 10.1007/978-3-642-03359-9_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5674)
Cite this paper as:
Schimpf A., Merz S., Smaus JG. (2009) Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL. In: Berghofer S., Nipkow T., Urban C., Wenzel M. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2009. Lecture Notes in Computer Science, vol 5674. Springer, Berlin, Heidelberg

Abstract

We present the implementation in Isabelle/HOL of a translation of LTL formulae into Büchi automata. In automaton-based model checking, systems are modelled as transition systems, and correctness properties stated as formulae of temporal logic are translated into corresponding automata. An LTL formula is represented by a (generalised) Büchi automaton that accepts precisely those behaviours allowed by the formula. The model checking problem is then reduced to checking language inclusion between the two automata. The automaton construction is thus an essential component of an LTL model checking algorithm. We implemented a standard translation algorithm due to Gerth et al. The correctness and termination of our implementation are proven in Isabelle/HOL, and executable code is generated using the Isabelle/HOL code generator.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alexander Schimpf
    • 1
  • Stephan Merz
    • 2
  • Jan-Georg Smaus
    • 1
  1. 1.University of FreiburgGermany
  2. 2.INRIA NancyFrance

Personalised recommendations