The Complexity of Temporal Logic over the Reals

Simple item page
dc.creatorReynolds, M.
dc.date1999-10-13
dc.date.accessioned2026-07-07T03:24:24Z
dc.date.available2026-07-07T03:24:24Z
dc.descriptionIt is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.
dc.identifierhttps://arxiv.org/abs/cs/9910012
dc.identifierhttp://arxiv.org/abs/cs/9910012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33311
dc.subjectLogic in Computer Science
dc.subjectComputational Complexity
dc.subjectF4.1;F2.2
dc.titleThe Complexity of Temporal Logic over the Reals
dc.typetext

Files

Collections

arXiv