Rabinizer: small deterministic automata for LTL (F,G)

Authors:
Andreas Gaiser;Jan Křetínský;Javier Esparza
Affiliations:
Institut für Informatik, Technische Universität München, Germany;Institut für Informatik, Technische Universität München, Germany,Faculty of Informatics, Masaryk University, Brno, Czech Republic;Institut für Informatik, Technische Universität München, Germany
Venue:
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Year:
2012

Citing 10
Cited 1

Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Experiments with deterministic ω-automata for formulas of linear temporal logic

Theoretical Computer Science - Implementation and application of automata
Observations on determinization of Büchi automata

Theoretical Computer Science - Implementation and application of automata
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
BEEM: benchmarks for explicit model checkers

Proceedings of the 14th international SPIN conference on Model checking software
PRISM 4.0: verification of probabilistic real-time systems

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
LTL to büchi automata translation: fast and more deterministic

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deterministic automata for the (f, g)-fragment of LTL

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 like ltl2dstar, which translate the formula into a Büchi automaton and apply Safra's determinization procedure, Rabinizer uses a direct construction based on the logical structure of the formulae. We describe a number of optimizations of the basic procedure, crucial for the good performance of Rabinizer, and present an experimental comparison.