LTL to Deterministic Emerson-Lei Automata

  title={LTL to Deterministic Emerson-Lei Automata},
  author={David M{\"u}ller and Salomon Sickert},
We introduce a new translation from linear temporal logic (LTL) to deterministic Emerson-Lei automata, which are omega-automata with a Muller acceptance condition symbolically expressed as a Boolean formula. The richer acceptance condition structure allows the shift of complexity from the state space to the acceptance condition. Conceptually the construction is an enhanced product construction that exploits knowledge of its components to reduce the number of states. We identify two fragments of… 

Figures and Tables from this paper

Rabinizer 4: From LTL to Your Favourite Deterministic Automaton
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.
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.
From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata
A new algorithm for the generation of unambiguous Büchi automata (UBA) from LTL formulas based on a known translation from very weak alternating automata(VWAA) to NBA is proposed and it is shown that the VWAA-to-NBA translation preserves unambiguity.
LTL to Smaller Self-Loop Alternating Automata and Back
This paper considers SLAA with generic transition-based Emerson-Lei acceptance and presents translations of LTL to these automata and back, which produces considerably smaller automata than previous translations ofLTL to Buchi or co-Buchi SLAA.
Model checking with generalized Rabin and Fin-less automata
This paper investigates whether using a more general form of acceptance, namely a transition-based generalized Rabin automaton (TGRA), improves the model checking procedure and introduces a Fin-less acceptance condition, which is a disjunction of TGBAs.
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.
Practical synthesis of reactive systems from LTL specifications via parity games
This work presents the adaption of the classic automata-theoretic approach to LTL synthesis, implemented in the tool Strix which has won the two last synthesis competitions, and evaluates the proposed techniques on the Syntcomp2019 benchmark set and shows in more detail how they compare to the techniques implemented in other leading LTL synthesisation tools.
Practical "Paritizing" of Emerson-Lei Automata
We introduce a new algorithm that takes a Transition-based Emerson-Lei Automaton (TELA), that is, an ω-automaton whose acceptance condition is an arbitrary Boolean formula on sets of transitions to
Optimal Transformations of Games and Automata Using Muller Conditions
A new transformation is defined called the alternating cycle decomposition, inspired and extending Zielonka’s construction, which operates on transition systems, encompassing both automata and games, and preserves semantic properties through the existence of a locally bijective morphism.


From LTL to Symbolically Represented Deterministic Automata
This paper generates symbolic descriptions of equivalent deterministic parity automata which was so far not possible for full LTL, using a new determinization procedure for ω-automata that stem from LTL formulas.
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
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.
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,
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.
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
This paper exploits the temporal logic hierarchy that corresponds to the well-known automata hierarchy as well as the non-confluence property of w-automata that result from certain translations of LTL formulas, and presents convincing experimental results that demonstrate the practical applicability of the new synthesis procedure.
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
This work presents an extension of PRISM for LTL model checking of MDP using LDBA, a special subclass of limit-deterministic Buchi automata that can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms.
Limit-Deterministic Büchi Automata for Linear Temporal Logic
This work presents a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton, which yields much smaller automata for formulas with deep nesting of modal operators and performs at least as well as the existing approaches on general formulas.
On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
The notion of partial stutter insensitiveness is introduced and the construction of potentially smaller deterministic ω-automata for such a property, e.g. using Safra’s determinization construction, is proposed.
Optimizing Büchi Automata
A family of optimizations implemented in a translation from a linear temporal logic to Buchi automata can enhance the efficiency of model checking, as practiced in tools such as SPIN.
Tighter Bounds for the Determinisation of Büchi Automata
This paper proposes a determinisation technique that is simpler than the constructions of Safra, Piterman, and Muller and Schupp, because it separates the principle acceptance mechanism from the concrete acceptance condition.