Efficient model checking for LTL with partial order snapshots

Peter Niebert, Doron Peled

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Certain behavioral properties of distributed systems are difficult to express in interleaving semantics, whereas they are naturally expressed in terms of partial orders of events or, equivalently, Mazurkiewicz traces. Two examples of such properties are serializability of a database and global snapshots of concurrent systems. Recently, a modest extension for LTL by an operator that expresses snapshots, has been proposed. It combines the ease of linear (interleaving) specification with this useful partial order concept. The new construct allows one to assert that a global snapshot appeared in the past, perhaps not in the observed execution sequence, but possibly in an equivalent one. Originally, a model checking algorithm for this logic that is exponential space in the size of the system was suggested. In this paper, we provide a model checking algorithm that is in polynomial space in the size of the system. Our construction can also serve as an efficient (polynomial) algorithm for detecting conjunctive properties (i.e., conjunction of local process properties) in a concurrent history of execution.

Original languageEnglish
Pages (from-to)4180-4189
Number of pages10
JournalTheoretical Computer Science
Issue number42
StatePublished - 28 Sep 2009


  • Concurrency
  • Model checking
  • Partial order semantics
  • Snapshots
  • Temporal logics


Dive into the research topics of 'Efficient model checking for LTL with partial order snapshots'. Together they form a unique fingerprint.

Cite this