The Complexity of Temporal Logic over the Reals
classification
💻 cs.LO
cs.CC
keywords
logictemporalcomplexityconnectivesdecisionproblempspace-completereal-numbers
read the original abstract
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.