Converting Linear Temporal Logic to Deterministic (Generalized) Rabin Automata

Salomon Sickert 📧

September 4, 2015

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


Recently, Javier Esparza and Jan Kretinsky proposed a new method directly translating linear temporal logic (LTL) formulas to deterministic (generalized) Rabin automata. Compared to the existing approaches of constructing a non-deterministic Buechi-automaton in the first step and then applying a determinization procedure (e.g. some variant of Safra's construction) in a second step, this new approach preservers a relation between the formula and the states of the resulting automaton. While the old approach produced a monolithic structure, the new method is compositional. Furthermore, in some cases the resulting automata are much smaller than the automata generated by existing approaches. In order to ensure the correctness of the construction, this entry contains a complete formalisation and verification of the translation. Furthermore from this basis executable code is generated.


BSD License


March 24, 2016
Make use of the LTL entry and include the simplifier.
September 23, 2015
Enable code export for the eager unfolding optimisation and reduce running time of the generated tool. Moreover, add support for the mlton SML compiler.


Session LTL_to_DRA