The complexity of the temporal logic with "until" over general linear time

Mark Reynolds

doi:10.1016/S0022-0000(03)00005-9

The complexity of the temporal logic with "until" over general linear time

Mark Reynolds

Research output: Contribution to journal › Article

33 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	393-426
Journal	Journal of Computer and System Sciences
Volume	66
Issue number	2
DOIs	https://doi.org/10.1016/S0022-0000(03)00005-9
Publication status	Published - 2003

Access to Document

10.1016/S0022-0000(03)00005-9

Fingerprint Dive into the research topics of 'The complexity of the temporal logic with "until" over general linear time'. Together they form a unique fingerprint.

Cite this

@article{7fd530fc7f3745409352a61ea17d3d5a,

title = "The complexity of the temporal logic with {"}until{"} over general linear time",

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

author = "Mark Reynolds",

year = "2003",

doi = "10.1016/S0022-0000(03)00005-9",

language = "English",

volume = "66",

pages = "393--426",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - The complexity of the temporal logic with "until" over general linear time

AU - Reynolds, Mark

PY - 2003

Y1 - 2003

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

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

U2 - 10.1016/S0022-0000(03)00005-9

DO - 10.1016/S0022-0000(03)00005-9

M3 - Article

VL - 66

SP - 393

EP - 426

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 2

ER -