{"doi":"10.1007/978-3-319-11936-6_17","conference":{"start_date":"2014-11-03","end_date":"2014-11-07","location":"Sydney, Australia","name":"ATVA: Automated Technology for Verification and Analysis"},"author":[{"last_name":"Komárková","first_name":"Zuzana","full_name":"Komárková, Zuzana"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"}],"_id":"2026","alternative_title":["LNCS"],"publication_status":"published","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","abstract":[{"text":"We present a tool for translating LTL formulae into deterministic ω-automata. It is the first tool that covers the whole LTL that does not use Safra’s determinization or any of its variants. This leads to smaller automata. There are several outputs of the tool: firstly, deterministic Rabin automata, which are the standard input for probabilistic model checking, e.g. for the probabilistic model-checker PRISM; secondly, deterministic generalized Rabin automata, which can also be used for probabilistic model checking and are sometimes by orders of magnitude smaller. We also link our tool to PRISM and show that this leads to a significant speed-up of probabilistic LTL model checking, especially with the generalized Rabin automata.","lang":"eng"}],"volume":8837,"date_updated":"2021-01-12T06:54:49Z","type":"conference","page":"235 - 241","status":"public","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Sponsor: P202/12/G061; GACR; Czech Science Foundation\r\n\r\n","department":[{"_id":"ToHe"}],"citation":{"ieee":"Z. Komárková and J. Kretinsky, “Rabinizer 3: Safraless translation of ltl to small deterministic automata,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 235–241.","ama":"Komárková Z, Kretinsky J. Rabinizer 3: Safraless translation of ltl to small deterministic automata. In: Cassez F, Raskin J-F, eds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8837. Springer; 2014:235-241. doi:10.1007/978-3-319-11936-6_17","mla":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer, 2014, pp. 235–41, doi:10.1007/978-3-319-11936-6_17.","short":"Z. Komárková, J. Kretinsky, in:, F. Cassez, J.-F. Raskin (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 235–241.","apa":"Komárková, Z., & Kretinsky, J. (2014). Rabinizer 3: Safraless translation of ltl to small deterministic automata. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 235–241). Sydney, Australia: Springer. https://doi.org/10.1007/978-3-319-11936-6_17","ista":"Komárková Z, Kretinsky J. 2014. Rabinizer 3: Safraless translation of ltl to small deterministic automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 235–241.","chicago":"Komárková, Zuzana, and Jan Kretinsky. “Rabinizer 3: Safraless Translation of Ltl to Small Deterministic Automata.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:235–41. Springer, 2014. https://doi.org/10.1007/978-3-319-11936-6_17."},"date_created":"2018-12-11T11:55:17Z","month":"01","title":"Rabinizer 3: Safraless translation of ltl to small deterministic automata","quality_controlled":"1","oa_version":"None","publist_id":"5045","intvolume":" 8837","language":[{"iso":"eng"}],"ec_funded":1,"year":"2014","publisher":"Springer","day":"01","editor":[{"last_name":"Cassez","full_name":"Cassez, Franck","first_name":"Franck"},{"last_name":"Raskin","first_name":"Jean-François","full_name":"Raskin, Jean-François"}],"date_published":"2014-01-01T00:00:00Z"}