Undecidability of partial order logics

Rajeev Alur; Doron Peled

doi:10.1016/s0020-0190(99)00005-8

Undecidability of partial order logics

Rajeev Alur, Doron Peled

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

In this paper we prove the undecidability of certain temporal logics over partial orders. Our proof is generic and can be applied to characterize various temporal operators that cannot be used for automatic verification (model checking).

Original language	English
Pages (from-to)	137-143
Number of pages	7
Journal	Information Processing Letters
Volume	69
Issue number	3
DOIs	https://doi.org/10.1016/s0020-0190(99)00005-8
State	Published - 12 Feb 1999
Externally published	Yes

Keywords

Concurrency
Formal languages
Program correctness
Program verification
Specification languages
Theory of computation

Access to Document

10.1016/s0020-0190(99)00005-8

Cite this

@article{cbd2729acb9e4b299719e03a8159cf47,

title = "Undecidability of partial order logics",

abstract = "In this paper we prove the undecidability of certain temporal logics over partial orders. Our proof is generic and can be applied to characterize various temporal operators that cannot be used for automatic verification (model checking).",

keywords = "Concurrency, Formal languages, Program correctness, Program verification, Specification languages, Theory of computation",

author = "Rajeev Alur and Doron Peled",

year = "1999",

month = feb,

day = "12",

doi = "10.1016/s0020-0190(99)00005-8",

language = "אנגלית",

volume = "69",

pages = "137--143",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Undecidability of partial order logics

AU - Alur, Rajeev

AU - Peled, Doron

PY - 1999/2/12

Y1 - 1999/2/12

N2 - In this paper we prove the undecidability of certain temporal logics over partial orders. Our proof is generic and can be applied to characterize various temporal operators that cannot be used for automatic verification (model checking).

AB - In this paper we prove the undecidability of certain temporal logics over partial orders. Our proof is generic and can be applied to characterize various temporal operators that cannot be used for automatic verification (model checking).

KW - Concurrency

KW - Formal languages

KW - Program correctness

KW - Program verification

KW - Specification languages

KW - Theory of computation

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

U2 - 10.1016/s0020-0190(99)00005-8

DO - 10.1016/s0020-0190(99)00005-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0033075080

SN - 0020-0190

VL - 69

SP - 137

EP - 143

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Undecidability of partial order logics

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this