Temporal logics over linear time domains are in PSPACE

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)40-67
Number of pages28
JournalInformation and Computation
Volume210
DOIs
StatePublished - Jan 2012

Fingerprint

Dive into the research topics of 'Temporal logics over linear time domains are in PSPACE'. Together they form a unique fingerprint.

Cite this