Skip to search formSkip to main contentSkip to account menu

Partial order reduction

Known as: Reduction 
In computer science, partial order reduction is a technique for reducing the size of the state-space to be searched by a model checking algorithm. It… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Traditionally, the state-space explosion problem in model checking is handled by applying abstractions and simplifications to the… 
2010
2010
Partial order reduction and distributed-memory processing are the two essential techniques to fight the well-known state space… 
2007
2007
2004
2004
Most approaches for model checking software are based on the generation of abstract models from source code, which may greatly… 
2002
2002
Partial order reduction helps improve the performance of a (sequential) model-checker by eliminating the interleaving of… 
2001
2001
State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order… 
1999
1999
This dissertation presents solutions for the application of partial order methods to the verification of timed systems, with the… 
1999
1999
The "state explosion problem" can be alleviated by using partial order reduction techniques. These methods rely on expanding only… 
1998
1998
The purpose of partial-order reduction techniques is to avoid exploring several interleavings of independent transitions when…