Temporal logics over linear time domains are in PSPACE

Alexander Rabinovich

doi:10.1016/j.ic.2011.11.002

Temporal logics over linear time domains are in PSPACE

Alexander Rabinovich

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	40-67
Number of pages	28
Journal	Information and Computation
Volume	210
DOIs	https://doi.org/10.1016/j.ic.2011.11.002
State	Published - Jan 2012

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1016/j.ic.2011.11.002

Cite this

@article{b66f54f2fc664e37a659dbb980b62634,

title = "Temporal logics over linear time domains are in PSPACE",

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.",

author = "Alexander Rabinovich",

year = "2012",

month = jan,

doi = "10.1016/j.ic.2011.11.002",

language = "الإنجليزيّة",

volume = "210",

pages = "40--67",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Temporal logics over linear time domains are in PSPACE

AU - Rabinovich, Alexander

PY - 2012/1

Y1 - 2012/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=82355162896&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2011.11.002

DO - 10.1016/j.ic.2011.11.002

M3 - مقالة

SN - 0890-5401

VL - 210

SP - 40

EP - 67

JO - Information and Computation

JF - Information and Computation

ER -

Temporal logics over linear time domains are in PSPACE

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this