Comparison of LTL to Deterministic Rabin Automata Translators
2013
Increasing interest in control synthesis and probabilistic model checking caused recent development of LTL to deterministic ω-automata translation. The standard approach represented by ltl2dstar tool employs Safra’s construction to determinize a Buchi automaton produced by some LTL to Buchi automata translator. Since 2012, three new LTL to deterministic Rabin automata translators appeared, namely Rabinizer, LTL3DRA, and Rabinizer 2. They all avoid Safra’s construction and work on LTL fragments only. We compare performance and automata produced by the mentioned tools, where ltl2dstar is combined with several LTL to Buchi automata translators: besides traditionally used LTL2BA, we also consider LTL− >NBA, LTL3BA, and Spot.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
43
References
17
Citations
NaN
KQI