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

Alexander Schimpf, Stephan Merz, and Jan-Georg Smaus

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.

© Springer-Verlag 2009

Available as: PDF

Reference

@InProceedings{schimpf:construction,
  author = 	 {Alexander Schimpf and Stephan Merz and Jan-Georg Smaus},
  title = 	 {Construction of {B\"uchi} Automata for {LTL} Model Checking Verified in {I}sabelle/{HOL}},
  booktitle = {22nd Intl. Conf. Theorem Proving in Higher-Order Logics (TPHOLs 2009)},
  pages = 	 {424-439},
  year = 	 2009,
  editor = 	 {Tobias Nipkow and Christian Urban},
  volume = 	 5674,
  series = 	 {Lecture Notes in Computer Science},
  address = 	 {Munich, Germany},
  publisher = {Springer},
}