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

    Research output: Contribution to journalArticle

    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 languageEnglish
    Pages (from-to)393-426
    JournalJournal of Computer and System Sciences
    Volume66
    Issue number2
    DOIs
    Publication statusPublished - 2003

    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