The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Handbook of theoretical computer science (vol. B)
Reasoning in a restricted temporal logic
Information and Computation
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Mosaic Method for Temporal Logics
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Temporal Verification of Simulation and Refinement
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Quantitative temporal logics over the reals: PSpace and below
Information and Computation
Addressing Temporal Aspects of Privacy-Related Norms
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
The complexity of temporal logic with until and since over ordinals
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A dyadic operator for the gradation of desirability
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
Temporal logics over linear time domains are in PSPACE
RP'10 Proceedings of the 4th international conference on Reachability problems
Temporal logics over linear time domains are in PSPACE
Information and Computation
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete. This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics. New techniques are used to give a PSPACE procedure for the logic.