Specification and Verification using Temporal Logics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2012

Specification and Verification using Temporal Logics


This chapter illustrates two aspects of automata theory related to linear-time temporal logic LTL used for the verification of computer systems. First, we present a translation from LTL formulae to Büchi automata. The aim is to design an elementary translation which is reasonably efficient and produces small automata so that it can be easily taught and used by hand on real examples. Our translation is in the spirit of the classical tableau constructions but is optimized in several ways. Secondly, we recall how temporal operators can be defined from regular languages and we explain why adding even a single operator definable by a context-free language can lead to undecidability.
Fichier principal
Vignette du fichier
DG-iis09.pdf (392.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00776601 , version 1 (06-04-2021)



Stéphane Demri, Paul Gastin. Specification and Verification using Temporal Logics. D'Souza, Deepak and Shankar, Priti. Modern applications of automata theory, 2, World Scientific, pp.457-494, 2012, ⟨10.1142/7237⟩. ⟨hal-00776601⟩
217 View
242 Download



Gmail Facebook Twitter LinkedIn More