Reasoning about infinite computation paths

This work investigates extensions of temporal logic by finite automata on infinite words by investigating the addition of alternation and shows that it does not increase the complexity of the decision problem.

Abstract

We investigate extensions of temporal logic by finite automata on infinite words. There are three different types of acceptance conditions (finite, looping and repeating) that one can give for these finite automata. This gives rise to three different logics. It turns out, however. that these logics have the same expressive power but differ in the complexity of their decision problem. We also investigate the addition of alternation and show that it does not increase the complexity of the decision problem.