Alternating automata and temporal logic normal forms

Abstract

We provide a translation from SNF PLTL, a normal form for propositional linear time temporal logic, into alternating automata on infinite words, and vice versa. We show this translation has the property that the set of SNF PLTL clauses is satisfiable if and only if the alternating automaton has an accepting run. As there is no direct method known for checking the non-emptiness of alternating automata, the translation to SNF PLTL, together with a temporal proof on the resulting SNF PLTL clauses, provides an indirect non-emptiness check for alternating automata.