From LTL to deterministic automata

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ . The automaton is the product of a co-Büchi automaton for φ and an array of Rabin automata, one for each G -subformula of φ . The Rabin automaton for G ψ is in charge of recognizing whether F G ψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As opposed to standard procedures based on Safra’s determinization, the states of all our automata have a clear logical structure, which allows for various optimizations. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.