Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis

  title={Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis},
  author={Krishnendu Chatterjee and Andreas Gaiser and Jan Křet{\'i}nsk{\'y}},
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller… 

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.

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

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

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.

Small Deterministic Automata for LTL\GU

A tool that generates automata for LTL U does not occur in any G-formula (but F still can) and is significantly smaller than deterministic Rabin automata generated by state-of-the-art tools.

Explicit state model checking with generalized Büchi and Rabin automata

This paper designed a multi-core TGRA checking algorithm and performed experiments on a subset of the models and formulas from the 2015 Model Checking Contest, observing that the algorithm can be used to replace a TGBA checking algorithm without losing performance.

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

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

Efficient approach of translating LTL formulae into Büchi automata

This paper presents a conversion algorithm to translate an LTL formula to a BA directly, and shows that it is more efficient for five families LTL formulae in common use and four sets of random formULae generated by LBTT (an LTL-to-Büchi translator testbench).



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.

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

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.

Optimizations for LTL Synthesis

This work constitutes the first implementation of a synthesis algorithm for full LTL by careful optimization of all intermediate automata, and uses an incremental algorithm to compute the emptiness of nondeterministic Buchi tree automata.

Deterministic generators and games for LTL fragments

  • R. AlurS. L. Torre
  • Computer Science, Mathematics
    Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
  • 2001
This paper identifies LTL fragments of lower complexity and shows tightness of the double-exponential bound on the size as well as the longest distance for deterministic generators for LTL, even in the absence of "next" and "until" modalities.

Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis

This approach inherits the good algorithmic properties of generalized reactivity(1) synthesis but extends it to also allow co-Buchi-type assumptions and guarantees, which makes it usable for the synthesis of robust systems.

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.

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic

Safra’s determinization algorithm is studied in detail, several heuristics that attempt to decrease the size of the resulting automata are presented and experimental results are reported on.

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.

Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.