# Rabinizer 4: From LTL to Your Favourite Deterministic Automaton

@inproceedings{Ketnsk2018Rabinizer4F,
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},
booktitle={CAV},
year={2018}
}
• Published in CAV 14 July 2018
• Computer Science
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…
A Unified Translation of Linear Temporal Logic to ω-Automata
• Computer Science
• 2020
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
• Computer Science
ICTAC
• 2019
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
• Computer Science
DLT
• 2019
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
• Computer Science
International Journal on Software Tools for Technology Transfer
• 2019
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.
Owl: A Library for ω-Words, Automata, and LTL
• Computer Science
ATVA
• 2018
The library Owl is presented, which forms a backbone of several translations from LTL to automata and related tools by different authors and is apt for easy prototyping of new tools in this area.
A Temporal Logic for Strategic Hyperproperties
• Computer Science
CONCUR
• 2021
This paper studies a novel class of hyperproperties where the individual computation paths are chosen by the strategic choices of a coalition of agents in a multi-agent system, and introduces HyperATL, an extension of computation tree logic with path variables and strategy quantifiers.
Index appearance record with preorders
• Computer Science
Acta Informatica
• 2021
An efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records are presented, showing that this method produces significantly smaller automata than previous approaches.
A Logic for Hyperproperties in Multi-Agent Systems
• Computer Science
ArXiv
• 2022
This paper studies a novel class of hyperproperties where the individual computation paths are chosen by the strategic choices of a coalition of agents in a multiagent system, and introduces HyperATL, an extension of computation tree logic with path variables and strategy quantifiers.
Checking LTL[F,G,X] on compressed traces in polynomial time
• Computer Science
ESEC/SIGSOFT FSE
• 2021
The problem of checking if an execution trace, compressed using a grammar-based lossless compression scheme, satisfies a specification expressed in linear temporal logic, without explicitly decompressing it can be solved in polynomial time for the fragment LTL.

## References

SHOWING 1-10 OF 59 REFERENCES
Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata
• Computer Science
ATVA
• 2014
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 2: Small Deterministic Automata for LTL ∖ GU
• Computer Science
ATVA
• 2013
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
• Computer Science
ATVA
• 2016
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.
LTL to Deterministic Emerson-Lei Automata
• Computer Science
GandALF
• 2017
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
• Computer Science
CAV
• 2013
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.
Limit Deterministic and Probabilistic Automata for LTL ∖ GU
• Computer Science, Mathematics
TACAS
• 2015
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
• Computer Science
CAV
• 2000
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,
LTL to Büchi Automata Translation: Fast and More Deterministic
• Computer Science
TACAS
• 2012
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.
Compositional Approach to Suspension and Other Improvements to LTL Translation
• Computer Science
SPIN
• 2013
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.
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
• Computer Science
TACAS
• 2017
This paper describes a single exponential translation from limit-deterministic Buchi automata (LDBA) to DPA, and shows that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, “Safraless” LTL-to-DPA construction.