Combining partial order reductions with on-the-fly model-checking

Research output: Contribution to journalArticlepeer-review

126 Scopus citations


Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the search by intersecting an automaton representing the (negation of the) checked property with the state space during its generation. We prove conditions under which these two methods can be combined in order to gain reduction from both. An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used. We also describe how to apply partial-order model-checking under given fairness assumptions.

Original languageEnglish
Pages (from-to)39-64
Number of pages26
JournalFormal Methods in System Design
Issue number1
StatePublished - 1996
Externally publishedYes


  • Büchi-automaton
  • Model-checking
  • Partial order reduction
  • Temporal-logic
  • Traces


Dive into the research topics of 'Combining partial order reductions with on-the-fly model-checking'. Together they form a unique fingerprint.

Cite this