Is There a Future for Deductive Temporal Verification?

C. Dixon, M. Fisher, B. Konev
2006 Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06)  
In this paper, we consider a tractable sub-class of propositional linear time temporal logic, and provide a complete clausal resolution calculus for it. The fragment is important as it captures simple Büchi automata. We also show that, just as the emptiness check for a Büchi automaton is tractable, the complexity of deciding unsatisfiability, via resolution, of our logic is polynomial (rather than exponential). Consequently, a Büchi automaton can be represented within our logic, and its
more » ... s can be tractably decided via deductive methods. This may have a significant impact upon approaches to verification, since techniques such as model checking inherently depend on the ability to check emptiness of an appropriate Büchi automaton. Thus, we also discuss how such a logic might form the basis for practical deductive temporal verification.
doi:10.1109/time.2006.19 dblp:conf/time/DixonFK06 fatcat:wwczidgbjncz5odkqhlht65v3a