%0 Journal Article %1 10.1145/3417995 %A Esparza, Javier %A Kret\'ınský, Jan %A Sickert, Salomon %C New York, NY, USA %D 2020 %I Association for Computing Machinery %J J. ACM %K journal %N 6 %R 10.1145/3417995 %T A Unified Translation of Linear Temporal Logic to ω-Automata %U https://doi.org/10.1145/3417995 %V 67 %X We present a unified translation of linear temporal logic (LTL) formulas into deterministic Rabin automata (DRA), limit-deterministic Büchi automata (LDBA), and nondeterministic Büchi automata (NBA). The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive Boolean combination of languages that can be translated into ω-automata by elementary means. In particular, Safra’s, ranking, and breakpoint constructions used in other translations are not needed. We further give evidence that this theoretical clean and compositional approach does not lead to large automata per se and in fact in the case of DRAs yields significantly smaller automata compared to the previously known approach using determinisation of NBAs.

@article{10.1145/3417995, abstract = {We present a unified translation of linear temporal logic (LTL) formulas into deterministic Rabin automata (DRA), limit-deterministic Büchi automata (LDBA), and nondeterministic Büchi automata (NBA). The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive Boolean combination of languages that can be translated into ω-automata by elementary means. In particular, Safra’s, ranking, and breakpoint constructions used in other translations are not needed. We further give evidence that this theoretical clean and compositional approach does not lead to large automata per se and in fact in the case of DRAs yields significantly smaller automata compared to the previously known approach using determinisation of NBAs.}, added-at = {2020-10-20T12:17:07.000+0200}, address = {New York, NY, USA}, articleno = {33}, author = {Esparza, Javier and Kret\'ınský, Jan and Sickert, Salomon}, biburl = {https://www.bibsonomy.org/bibtex/2affc4811414cd2894f8337d5e9b6f347/paves}, doi = {10.1145/3417995}, interhash = {e05e0f24ab479bc71f2aa9b942e418c4}, intrahash = {affc4811414cd2894f8337d5e9b6f347}, issn = {0004-5411}, issue_date = {October 2020}, journal = {J. ACM}, keywords = {journal}, month = oct, number = 6, numpages = {61}, publisher = {Association for Computing Machinery}, timestamp = {2023-09-24T19:53:16.000+0200}, title = {A Unified Translation of Linear Temporal Logic to ω-Automata}, url = {https://doi.org/10.1145/3417995}, volume = 67, year = 2020 }