English

The Complexity of Temporal Logic over the Reals

Logic in Computer Science 2007-05-23 v1 Computational Complexity

Abstract

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

Cite

@article{arxiv.cs/9910012,
  title  = {The Complexity of Temporal Logic over the Reals},
  author = {M. Reynolds},
  journal= {arXiv preprint arXiv:cs/9910012},
  year   = {2007}
}
R2 v1 2026-07-22T12:29:22.646Z