Rabinizer 4: From LTL to Your Favourite Deterministic Automaton

  title={Rabinizer 4: From LTL to Your Favourite Deterministic Automaton},
  author={Jan Křet{\'i}nsk{\'y} and Tobias Meggendorfer and Salomon Sickert and Christopher Ziegler},
We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different types of deterministic \(\omega \)-automata. The tool set implements and optimizes several recent constructions, including the first implementation translating the frequency extension of LTL. Further, we provide a distribution of PRISM that links Rabinizer and offers model checking procedures for probabilistic systems that are not in the official PRISM distribution. Finally, we evaluate the… 
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.
Efficient Translation of Safety LTL to DFA Using Symbolic Automata Learning and Inductive Inference
A symbolic adaptation of the \(L^*\) active learning algorithm tailored to efficiently translate safety LTL properties into symbolic DFA and demonstrates how an inductive inference procedure can be used to provide additional input to the algorithm that greatly improves performance for certain important families of properties.
Generic Emptiness Check for Fun and Profit
We present a new algorithm for checking the emptiness of \(\omega \)-automata with an Emerson-Lei acceptance condition (i.e., a positive Boolean formula over sets of states or transitions that must
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.
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.
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.
Eventually Safe Languages
It is shown that GFG automata still enjoy exponential succinctness for LTL-definable languages and introduces a class of properties called “eventually safe” together with a specification language \( E \nu \mathrm {TL}\) for this class.
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.
New Optimizations and Heuristics for Determinization of Büchi Automata
In this work, we present multiple new optimizations and heuristics for the determinization of Buchi automata that exploit a number of semantic and structural properties, most of which may be applied


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.
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
Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
A tool that generates automata for LTL(X,F,G,U) where U does not occur in any G-formula (but F still can) where DGRA have been recently shown to be as useful in probabilistic model checking as DRA.
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.
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
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.
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
This work considers deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW) as an alternative to DRW, and presents algorithms for probabilistic model-checking as well as game solving for DGRW conditions.
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.
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,
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,