TY  - CHAP
N1  - The original publication is available at www.springerlink.com
AV  - none
TI  - Partial Order Reduction in Directed Model Checking
SP  - 95
T3  - Lecture Notes in Computer Science
UR  - http://dx.doi.org/10.1007/3-540-46017-9_10
M1  - 2318
A1  - Lluch-Lafuente, Alberto
A1  - Edelkamp, Stefan
A1  - Leue, Stefan
Y1  - 2002///
ED  - Bosnacki, Dragan
ED  - Leue, Stefan
SN  - 3-540-43477-1
ID  - eprints169
EP  - 138
N2  - Partial order reduction is a very succesful technique for avoiding the state explosion problem that is inherent to explicit state model checking of asynchronous concurrent systems. It exploits the commutativity of concurrently executed transitions in interleaved system runs in order to reduce the size of the explored state space. Directed model checking on the other hand addresses the state explosion problem by using guided search techniques during state space exploration. As a consequence, shorter errors trails are found and less search effort is required than when using standard depth-first or breadth-first search. We analyze how to combine directed model checking with partial order reduction methods and give experimental results on how the combination of both techniques performs.

PB  - Springer
T2  - Model Checking Software (SPIN '02)
ER  -