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

  title={LTL to B{\"u}chi Automata Translation: Fast and More Deterministic},
  author={Tom{\'a}s Babiak and Mojm{\'i}r Kret{\'i}nsk{\'y} and Vojtech Reh{\'a}k and Jan Strej{\vc}ek},
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Buchi automata via very weak alternating co-Buchi automata and generalized Buchi automata. Several improvements are based on specific properties of any formula where each branch of its syntax tree contains at least one eventually operator and at least one always operator. These changes usually result in faster translations and smaller automata. Other improvements reduce non-determinism in the produced… 

LTL transformation modulo positive transitions

  • M. Bourahla
  • Computer Science
    IET Comput. Digit. Tech.
  • 2017
A new efficient algorithm for translating linear temporal logic (LTL) formulas to Buchi automata, which are used by LTL model checkers, using the principle of alternating automata and keeping only the positive transitions without generating the intermediate generalised automata.

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.

Compositional Approach to Suspension and Other Improvements to LTL Translation

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.

A Better Translation From LTL to Transition-Based Generalized Büchi Automata

This paper decomposes the translation from LTL to TGBA into three steps to give a step-wise description and improves all three steps, and introduces a new definition of acceptance conditions.

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.

ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata

Experimental evaluation shows that ltl3tela can produce deterministic automata that are, on average, noticeably smaller than deterministic TELA produced by state-of-the-art translators Delag, Rabinizer 4, and Spot.

LTL translation improvements in Spot 1.0

  • A. Duret-Lutz
  • Computer Science
    Int. J. Crit. Comput. Based Syst.
  • 2014
This paper focuses on Spot's module for translating linear-time temporal logic LTL formulas into Buchi automata: one of the steps required in the automata-theoretic approach to LTL model-checking.

Is there a best büchi automaton for explicit model checking?

This paper searches for properties of Büchi automata that really influence the performance of explicit model checkers by manual analysis of several automata and by experiments with common LTL-to-BA translators and realistic verification tasks.

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.



LTL to Buchi Automata Translation: Fast and More Deterministic ?

  • Tom
  • Computer Science
  • 2012
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae into Buchi automata via very weak alternating co-Buchi automata and generalized Buchi automata. Sev- eral

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,

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.

From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata

This paper describes how, by labeling automata transitions rather than states, the size of automata generated by existing tableau-based translation algorithms is significantly reduced.

Minimal Büchi Automata for Certain Classes of LTL Formulas

The minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking are calculated.

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.

"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 ϕ.

Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋆

This paper shows how and when the standard powerset construction for automata over finite words can be used to determinize Automata over infinite words, and presents applications of this new determinization construction to improve the automata-based approach for the mixed firstorder linear arithmetic over the reals and the integers.

On the Virtue of Patience: Minimizing Büchi Automata

This work proposes a new technique that achieves significant further reductions when more time can be invested in the minimization of the automaton, and uses a modified SAT solver to perform bounded language inclusion checks on partial solutions.

Testing LTL formula translation into Büchi automata

A randomized testing approach based on the cross-comparison of independent translator implementations, and methods for test failure analysis are presented, which has helped to detect errors in model checking tools such as Spin.