Relaxed visibility enhances partial order reduction

DOI10.1023/A:1011202615884zbMath0995.68060MaRDI QIDQ5949489

Doron A. Peled, Antti Valmari, Ilkka Kokkarinen

Publication date: 23 October 2002

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

concurrent systemsmodel-checkingstate-space explosionautomatic verification

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Partial-Order Reduction ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Question-guided stubborn set methods for state properties ⋮ Transparent partial order reduction ⋮ On stubborn sets in the verification of linear time temporal properties ⋮ On Stubborn Sets in the Verification of Linear Time Temporal Properties ⋮ Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods ⋮ Exploring the Scope for Partial Order Reduction

This page was built for publication: Relaxed visibility enhances partial order reduction