Undecidability of partial order logics

Rajeev Alur, Doron Peled

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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 languageEnglish
Pages (from-to)137-143
Number of pages7
JournalInformation Processing Letters
Issue number3
StatePublished - 12 Feb 1999
Externally publishedYes


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


Dive into the research topics of 'Undecidability of partial order logics'. Together they form a unique fingerprint.

Cite this