Skip to main content
Article thumbnail
Location of Repository

Undecidability of Partial Order Logics

By Rajeev Alur and Doron Peled


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

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.