Abstract
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-Buchi 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-Buchi 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
