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 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.
KeywordsLinear Temporal Logic Acceptance Condition Linear Time Temporal Logic Fairness Constraint Deterministic Automaton
Unable to display preview. Download preview PDF.