The Complexity of Temporal Logic over the Reals

M. Reynolds

It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.