# From LTL to deterministic automata

@article{Esparza2016FromLT,
title={From LTL to deterministic automata},
author={J. Esparza and Jan Kret{\'i}nsk{\'y} and Salomon Sickert},
journal={Formal Methods in System Design},
year={2016},
volume={49},
pages={219-271}
}
• Published 2016
• Computer Science
• Formal Methods in System Design
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula $$\varphi$$φ. The automaton is the product of a co-Büchi automaton for $$\varphi$$φ and an array of Rabin automata, one for each $${\mathbf {G}}$$G-subformula of $$\varphi$$φ. The Rabin automaton for $${\mathbf {G}}\psi$$Gψ is in charge of recognizing whether $${\mathbf {F}}{\mathbf {G}}\psi$$FGψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As… Expand
14 Citations

#### References

SHOWING 1-10 OF 48 REFERENCES
On the complexity of omega -automata
• S. Safra
• Mathematics, Computer Science
• [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
• 1988
• 467
• PDF
Safraless decision procedures
• Mathematics, Computer Science
• 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
• 2005
• 221
• PDF
Fast LTL to Büchi Automata Translation
• Computer Science
• CAV
• 2001
• 681
• PDF