The Complexity of Temporal Logic over the Reals
arXiv:cs/9910012
Abstract
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.
arXiv:cs/9910012
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.