by Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek
Information and Computation
http://www.ipipan.waw.pl/mas/WPenczek/papersPS/IC99.ps
Add To MetaCart
Abstract:
Partial order techniques enable reducing the size of the state space used for model checking, thus alleviating the `state space explosion ' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The present paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL (with the nexttime operator removed) and process algebra logics such as Hennesy-Milner Logic (with actions). Conditions on the selection of subset of successors from each state during the state-space construction, which guarantee reduction that preserves CTL
Citations
|
1070
|
A Calculus of Communicating Systems
– Milner
- 1980
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
402
|
Algebraic laws for nondeterminism and concurrency
– Hennessy, Milner
- 1985
|
|
247
|
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
233
|
A stubborn attack on state explosion
– Valmari
- 1991
|
|
210
|
P.: An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
203
|
Branching time and abstraction in bisimulation semantics
– Glabbeek, Weijland
- 1996
|
|
157
|
What good is temporal logic
– Lamport
- 1983
|
|
157
|
Combining partial order reductions withon-the-fly model checking
– Peled
- 1994
|
|
132
|
Using partial orders to improve automatic verification methods,” in Proc. Computer Aided Verification Workshop
– Godefroid
- 1990
|
|
105
|
A partial approach to model checking
– Godefroid, Wolper
- 1991
|
|
103
|
All from One, One for All: On Model Checking Using Representatives
– Peled
- 1993
|
|
96
|
Trace theory
– Mazurkiewicz
- 1987
|
|
91
|
Sometimes" and "Not Never" Revisited: on Branching Versus Linear Time Temporal Logic
– Emerson, Halpern
|
|
91
|
An improvement in formal verification
– Holzmann, Peled
- 1994
|
|
79
|
Three Logics of Branching Bisimulation
– Nicola, Vaandrager
- 1990
|
|
56
|
Coverage preserving reduction strategies for reachability analysis
– Holzmann, Godefroid, et al.
- 1992
|
|
55
|
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
– Dolev, Klawe, et al.
- 1982
|
|
49
|
A process specification formalism
– Mauw, Veltink
- 1990
|
|
47
|
Checking that finite-state concurrent programs satisfy their linear specification
– Lichtenstein, Pnueli
- 1984
|
|
46
|
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
– Groote, Vaandrager
- 1990
|
|
44
|
Refining dependencies improves partial-order verification methods
– Godefroid, Pirottin
|
|
31
|
Aboard AUTO
– Simone, Vergamini
- 1989
|
|
31
|
Partial order reduction: Linear and branching temporal logics and process algebras
– Peled
- 1996
|
|
24
|
Verification of distributed pro-grams using representative interleaving sequences. Distributed Computing
– Katz, Peled
- 1992
|
|
16
|
Characterizing Finite Kripke Structures
– Browne, Clarke, et al.
- 1988
|
|
9
|
A process specification formalism, Fundamenta Informaticae XIII
– Mauw, Veltink
- 1990
|
|
7
|
On the fly verification of behavioral equivalences and preorders
– Fernandez, Mounier
- 1991
|
|
1
|
Efficient Verification of Determinate
– Qin
- 1991
|
|
1
|
Stubborn sets for reduced state graph generation
– Valmari
- 1989
|
|
1
|
An improvement in formal verification, FORTE'94, Formal Description Techniques
– Holzmann, Peled
- 1994
|
