One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata

  title={One Theorem to Rule Them All: A Unified Translation of LTL into $\omega$-Automata},
  author={Javier Esparza and Jan Křet{\'i}nsk{\'y} and Salomon Sickert},
  journal={Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi automata, and nondeterministic Büchi automata. The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive boolean combination of languages that can be translated into… 

A Unified Translation of Linear Temporal Logic to ω-Automata

A unified translation of LTL formulas into nondeterministic Buchi automata, limit-deterministic LTL automata (LDBA), and deterministic Rabin Automata (DRA) is presented.

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 Compositional and Unified Translation of LTL into ω-Automata

This approach decomposes LTL formulas into simple languages and allows a clear separation of concerns, and instantiates this generic theory to obtain a construction for deterministic (state-based) Rabin automata (DRA).

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

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.

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

A single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA is described and it is shown that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction.

Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization

The second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata is presented, providing a new way to complement automata that is competitive with state-of-the-art complementation tools.

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

This work presents a direct and purely syntactic normalisation procedure for LTL yielding a normal form, comparable to the one by Chang, Manna, and Pnueli, that has only a single exponential blow-up.

From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata

A new determinization construction is introduced which determinizes several GBA separately and combines them using a product construction, and one version of the limit-determinization procedure yields good-for-MDP automata which can be used for quantitative probabilistic model checking.

Owl: A Library for ω-Words, Automata, and LTL

The library Owl is presented, which forms a backbone of several translations from LTL to automata and related tools by different authors and is apt for easy prototyping of new tools in this area.

Determinization and Limit-determinization of Emerson-Lei automata

This work introduces three new ways of translating TELA to GBA and gives a new determinization construction which determinizes several GBA separately and combines them using a product construction, which is competitive when compared with state-of-the-art determinization procedures.



LTL to Büchi Automata Translation: Fast and More Deterministic

Improvements in the algorithm are introduced by Gastin and Oddoux translating LTL formulae into Buchi automata via very weak alternating co-BuchiAutomata and generalized Buchi Automata based on specific properties of any formula.

Efficient Büchi Automata from LTL Formulae

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,

Deterministic Automata for the (F,G)-fragment of LTL

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.

From LTL to Deterministic Automata: A Safraless Compositional Approach

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

Rabinizer: Small Deterministic Automata for LTL(F, G)

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

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment

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.

Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata

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.

Fast LTL to Büchi Automata Translation

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.

Limit Deterministic and Probabilistic Automata for LTL ∖ GU

LTL i¾? GU is a fragment of linear temporal logic LTL, where negations appear only on propositions, and formulas are built using the temporal operators X next, F eventually, G always, and U until,

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

This procedure computes simulation relations for alternating Buchi automata in an early stage and uses them in an on the-fly fashion to decrease the time and space consumption without sacrificing the potential of simulation relations.