The Complexity of Temporal Logic over the Reals
<|reference_start|>The Complexity of Temporal Logic over the Reals: It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.<|reference_end|>
@article{reynolds1999the,
    title={The Complexity of Temporal Logic over the Reals},
    author={M. Reynolds},
    journal={arXiv preprint arXiv:cs/9910012},
    year={1999},
    archivePrefix={arXiv},
    eprint={cs/9910012},
    primaryClass={cs.LO cs.CC}
}