Compositional Approach to Suspension and Other Improvements to LTL Translation

  title={Compositional Approach to Suspension and Other Improvements to LTL Translation},
  author={Tom{\'a}s Babiak and Th. Badie and Alexandre Duret-Lutz and Mojm{\'i}r Kret{\'i}nsk{\'y} and Jan Strej{\vc}ek},
Recently, there was defined a fragment of LTL (containing fairness properties among other interesting formulae) whose validity over a given infinite word depends only on an arbitrary suffix of the word. Building upon an existing translation from LTL to Buchi automata, we introduce a compositional approach where subformulae of this fragment are translated separately from the rest of an input formula and the produced automata are composed in a way that the subformulae are checked only in relevant… 

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.

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.

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.

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.

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.

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.

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.

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.

Mechanizing the Minimization of Deterministic Generalized Büchi Automata

This work surveys techniques used to obtain and minimize DBAs for different classes of properties and presents benchmarks using a framework that implements all these techniques.

Lost in Translation: from Linear Temporal Logic to Büchi Automata

In the automata-theoretic approach to languages, formulas from a domain-specific language (such as regular expressions over finite words or a temporal logic over infinite words) are translated to



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,

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.

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.

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

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.

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.

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.

SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata

  • A. Duret-LutzD. Poitrenaud
  • Computer Science
    The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings.
  • 2004
This work motivates the choice of TGBA by illustrating a very simple (yet efficient) translation of LTL (linear temporal logic) into TGBA, and shows how it supports on-the-fly computations, and how it can be extended or integrated in other tools.

Improved Automata Generation for Linear Temporal Logic

The experimental results show that the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula outperforms the previous one, with respect to both the size of the generated automata and computation time.