Document Open Access Logo

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

Authors Julian Brunner , Benedikt Seidl , Salomon Sickert

Thumbnail PDF


  • Filesize: 0.59 MB
  • 19 pages

Document Identifiers

Author Details

Julian Brunner
  • Technische Universität München, Germany
Benedikt Seidl
  • Technische Universität München, Germany
Salomon Sickert
  • Technische Universität München, Germany


The authors want to thank Manuel Eberl, Javier Esparza, Lars Hupel, Peter Lammich, and Tobias Nipkow for their helpful comments and technical expertise.

Cite AsGet BibTex

Julian Brunner, Benedikt Seidl, and Salomon Sickert. A Verified and Compositional Translation of LTL to Deterministic Rabin Automata. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 11:1-11:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)


We present a formalisation of the unified translation approach from linear temporal logic (LTL) to omega-automata from [Javier Esparza et al., 2018]. This approach decomposes LTL formulas into "simple" languages and allows a clear separation of concerns: first, we formalise the purely logical result yielding this decomposition; second, we develop a generic, executable, and expressive automata library providing necessary operations on automata to re-combine the "simple" languages; third, we instantiate this generic theory to obtain a construction for deterministic Rabin automata (DRA). We extract from this particular instantiation an executable tool translating LTL to DRAs. To the best of our knowledge this is the first verified translation of LTL to DRAs that is proven to be double-exponential in the worst case which asymptotically matches the known lower bound.

Subject Classification

ACM Subject Classification
  • Theory of computation → Automata over infinite objects
  • Theory of computation → Modal and temporal logics
  • Theory of computation → Interactive proof systems
  • Automata Theory
  • Automata over Infinite Words
  • Deterministic Automata
  • Linear Temporal Logic
  • Model Checking
  • Verified Algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail