Skip to Main content Skip to Navigation
Conference papers

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

Alexander Schimpf Stephan Merz 1 Jan-Georg Smaus 
1 MOSEL - Proof-oriented development of computer-based systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Tuesday, August 4, 2009 - 3:19:08 PM
Last modification on : Friday, February 4, 2022 - 3:19:18 AM

Links full text




Alexander Schimpf, Stephan Merz, Jan-Georg Smaus. Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL. 22nd International Conference Theorem Proving in Higher-Order Logics - TPHOLs 2009, Aug 2009, Munich, Germany. pp.424-439, ⟨10.1007/978-3-642-03359-9_29⟩. ⟨inria-00408950⟩



Record views