Temporal logics over linear time domains are in PSPACE

Authors:
Alexander Rabinovich
Affiliations:
The Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Information and Computation
Year:
2012

Citing 9
Cited 0

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the First International Conference on Temporal Logic

ICTL '94 Proceedings of the First International Conference on Temporal Logic
Automata on Linear Orderings

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
The complexity of the temporal logic with "until" over general linear time

Journal of Computer and System Sciences
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
Logic and rational languages of words indexed by linear orderings

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Temporal logics over linear time domains are in PSPACE

RP'10 Proceedings of the 4th international conference on Reachability problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.