Abstract
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 Büchi automaton produced by some LTL to Büchi 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 Büchi automata translators: besides traditionally used LTL2BA, we also consider LTL->NBA, LTL3BA, and Spot. © Springer-Verlag 2013.
Cite
CITATION STYLE
Blahoudek, F., Křetínský, M., & Strejček, J. (2013). Comparison of LTL to deterministic Rabin automata translators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8312 LNCS, pp. 164–172). https://doi.org/10.1007/978-3-642-45221-5_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
