# From LTL to Deterministic Automata: A Safraless Compositional Approach

@inproceedings{Esparza2014FromLT,
title={From LTL to Deterministic Automata: A Safraless Compositional Approach},
author={Javier Esparza and Jan Křet{\'i}nsk{\'y}},
booktitle={CAV},
year={2014}
}
• Published in CAV 14 February 2014
• Computer Science
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of i¾?. The slave automaton for G i¾? is in charge of recognizing whether FG i¾? holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former…
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton
• Computer Science
CAV
• 2018
Rabinizer 4 is presented, a tool set for translating formulae of linear temporal logic to different types of deterministic $$\omega$$-automata and enhancements both in terms of the size of the automata and the computational time are shown, due to algorithmic as well as implementation improvements.
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
• Computer Science
ATVA
• 2014
This paper presents a tool for translating LTL formulae into deterministic ω-automata, the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants, and shows that this leads to significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.
Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata
This entry contains a complete formalisation and verification of the translation of linear temporal logic formulas to deterministic Rabin automata, and from this basis executable code is generated.
Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata
• Computer Science
ITP
• 2018
This work presents a formalization of a translation from LTL formulae to generalized Buchi automata in the HOL4 theorem prover, and uses the CakeML compiler to generate fully verified machine code implementing the translation.
Probabilistic Büchi Automata for LTL\GU
• Computer Science
• 2015
This work construction is a new, improved EXPTIME model checking algorithm for Markov Decision Processes and LTL\GU formulae that is exponential in the size of the formula.
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
• Computer Science
LICS
• 2018
A unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi Automata, and nondeterministicBüchi automata derived from one single Master Theorem of purely logical nature is presented.
A Unified Translation of Linear Temporal Logic to ω-Automata
• Computer Science
• 2020
A unified translation of LTL formulas into nondeterministic Buchi automata, limit-deterministic LTL automata (LDBA), and deterministic Rabin Automata (DRA) is presented.
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
• Computer Science
TACAS
• 2017
This paper describes a single exponential translation from limit-deterministic Buchi automata (LDBA) to DPA, and shows that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, “Safraless” LTL-to-DPA construction.
A Unified Translation of Linear Temporal Logic to ω-Automata
Evidence is given that this theoretical clean and compositional approach does not lead to large automata per se and in fact in the case of DRAs yields significantly smaller automata compared to the previously known approach using determinisation of NBAs.
A Verified and Compositional Translation of LTL to Deterministic Rabin Automata
• Computer Science
ITP
• 2019
This work develops a generic, executable, and expressive automata library providing necessary operations on automata to re-combine the “simple” languages and extracts from this particular instantiation an executable tool translating LTL to DRAs.

## References

SHOWING 1-10 OF 74 REFERENCES
Deterministic Automata for the (F,G)-fragment of LTL
• Computer Science
CAV
• 2012
This work presents a direct translation of the ( F, G )-fragment of LTL into deterministic ω-automata with no determinization procedure involved and investigates the complexity of this translation and provides experimental results and compare them to the traditional method.
Rabinizer: Small Deterministic Automata for LTL(F, G)
• Computer Science
ATVA
• 2012
We present Rabinizer, a tool for translating formulae of the fragment of linear temporal logic with the operators F (eventually) and G (globally) into deterministic Rabin automata. Contrary to tools
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
• Computer Science
ATVA
• 2014
This paper presents a tool for translating LTL formulae into deterministic ω-automata, the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants, and shows that this leads to significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.
Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
• Computer Science
ATVA
• 2013
A tool that generates automata for LTL(X,F,G,U) where U does not occur in any G-formula (but F still can) where DGRA have been recently shown to be as useful in probabilistic model checking as DRA.
Efficient Büchi Automata from LTL Formulae
• Computer Science
CAV
• 2000
We present an algorithm to generate small Buchi automata for LTL formulae. We describe a heuristic approach consisting of three phases: rewriting of the formula, an optimized translation procedure,
Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata
This entry contains a complete formalisation and verification of the translation of linear temporal logic formulas to deterministic Rabin automata, and from this basis executable code is generated.
Compositional Approach to Suspension and Other Improvements to LTL Translation
• Computer Science
SPIN
• 2013
A compositional approach is introduced where subformulae of this fragment of LTL are translated separately from the rest of an input formula and the produced automata are composed in a way that the sub formulae are checked only in relevant accepting strongly connected components of the final automaton.
Fast LTL to Büchi Automata Translation
• Computer Science
CAV
• 2001
An algorithm to generate Buchi automata from LTL formulae is presented and compared with Spin: the experiments show that the algorithm is much more efficient than Spin.
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment
• Computer Science
ATVA
• 2013
This work presents a new translation to deterministic Rabin automata via alternating automata and deterministic transition-based generalized RabinAutomata that can produce significantly smaller automata compared to Rabinizer and ltl2dstar.
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
• Computer Science
CAV
• 2013
This work considers deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW) as an alternative to DRW, and presents algorithms for probabilistic model-checking as well as game solving for DGRW conditions.