Temporal logics over linear time domains are in PSPACE

Alexander Rabinovich*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationReachability Problems - 4th International Workshop, RP 2010, Proceedings
Pages29-50
Number of pages22
DOIs
StatePublished - 2010
Event4th International Workshop on Reachability Problems, RP 2010 - Brno, Czech Republic
Duration: 28 Aug 201029 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6227 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Workshop on Reachability Problems, RP 2010
Country/TerritoryCzech Republic
CityBrno
Period28/08/1029/08/10

Fingerprint

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

Cite this