The Complexity of Temporal Logic over the Reals

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Logic in Computer Science, Computational Complexity, F4.1;F2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33311

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9910012
 http://arxiv.org/abs/cs/9910012

Collections

arXiv