From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

  title={From LTL and Limit-Deterministic B{\"u}chi Automata to Deterministic Parity Automata},
  author={Javier Esparza and Jan Křet{\'i}nsk{\'y} and Jean-François Raskin and Salomon Sickert},
Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic Buchi… 

LTL to Deterministic Emerson-Lei Automata

A new translation from linear temporal logic to deterministic Emerson-Lei automata with a Muller acceptance condition symbolically expressed as a Boolean formula is introduced, which is an enhanced product construction that exploits knowledge of its components to reduce the number of states.

Reactive Synthesis from LTL Specification with Spot

We present ltlsynt, a new tool for reactive synthesis from LTL specifications. It relies on the efficiency of Spot [8] to translate the input LTL specification to a deterministic parity automaton.

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.

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.

Almost-Symbolic Synthesis via ∆2-Normalisation for Linear Temporal Logic

An almost-symbolic version of this classic idea that performs the following steps: normalisation of the specification into a Boolean combination of “simple” fragment of LTL, translation of each “ simple” subformula into a deterministic automaton, encoding of each automaton into a binary decision diagram (BDD), and construction of a parity automaton by operations on the BDD.

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.

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.

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

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.

Strix: Explicit Reactive Synthesis Strikes Back!

Strix is a new tool for reactive LTL synthesis combining a direct translation of LTL formulas into deterministic parity automata (DPA) and an efficient, multi-threaded explicit state solver for

Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition

This work classify the strongly connected components of the given NBA as inherently weak, deterministic accepting, and nondeterministic accepting; this results in an easier handling of the determinization algorithm that takes advantage of the structure of that SCC.



Comparison of LTL to Deterministic Rabin Automata Translators

This work compares performance and automata produced by the mentioned tools, where ltl2dstar is combined with several LTL to Buchi automata translators: besides traditionally used LTL2BA, this work also considers LTL− >NBA, LTL3BA, and Spot.

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,

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

"More Deterministic" vs. "Smaller" Büchi Automata for Efficient LTL Model Checking

This paper builds on a different conjecture and presents an alternative approach in which Buchi automata are generated which are “as deterministic as possible”, in the sense that they try to reduce as much as they are able to the presence of non-deterministic decision states in A ϕ.

The Blowup in Translating LTL to Deterministic Automata

The problem of the exact blow-up of the translation of LTL formulas to nondeterministic automata is solved and the lower bound for the translation is tightened to 22Ω(n).

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.

Complementing Semi-deterministic Büchi Automata

It is shown that semi-determinism leads to a simpler complementation procedure: an extended breakpoint construction that allows for symbolic implementation, and this algorithm outperforms the known complementation techniques for general nondeterministic Buchi automata.

Profile trees for Büchi word automata, with application to determinization

The theory of profiles is extended to prove that every run dag contains a profile tree with at most a finite number of infinite branches, and it is shown that this property provides a theoretical grounding for a new determinization construction where macrostates are doubly preordered sets of states.

Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking

New efficient algorithms for LTL satisfiability and model-checking are proposed that work directly with alternating automata using efficient exploration techniques based on antichains.

On the complexity of omega -automata

  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.