Download:
|
by Kimmo Varpaaniemi
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
http://www.tcs.hut.fi/pub/Publications/papers/kvapn94.ps.Z
Add To MetaCart
Abstract:
Abstract. Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suoeers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This paper considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state space when searching for undesirable reachable terminal states, also called deadlocks. These methods have been combined by Godefroid, Pirottin, and Wolper to further reduce the number of inspected states. However, the combination presented by them places assumptions on the stubborn sets used. This paper shows that at least in place/transition nets, the stubborn set method can be combined with the sleep set method in such a way that all reachable terminal states are found, without having to place any assumption on the stubborn sets used. This result is shown by showing a more general result which gives a suOEcient condition for a method to be compatible with the sleep set method in the detection of reachable terminal states in place/transition nets. Topics: system verication using nets, analysis and behaviour of nets
Citations
|
469
|
nets: an introduction
– Petri
- 1985
|
|
233
|
A stubborn attack on state explosion
– Valmari
- 1991
|
|
132
|
Using partial orders to improve automatic verification methods,” in Proc. Computer Aided Verification Workshop
– Godefroid
- 1990
|
|
116
|
Stubborn Sets for Reduced State Space Generation
– Valmari
- 1989
|
|
103
|
All from One, One for All: On Model Checking Using Representatives
– Peled
- 1993
|
|
42
|
State space caching revisited
– Godefroid, Holzmann, et al.
- 1992
|
|
39
|
An efficient reactive planner for synthesizing reactive plans
– Godefroid, Kabanza
- 1991
|
|
24
|
Verification of distributed pro-grams using representative interleaving sequences. Distributed Computing
– Katz, Peled
- 1992
|
|
21
|
Verification of Concurrent Systems: Function and Timing
– Overman
- 1981
|
|
16
|
Formalization of Properties of Parallel Programs
– Ashcroft, Manna
- 1971
|
|
16
|
Stubborn Sets of Coloured Petri Nets
– Valmari
- 1991
|
|
9
|
Eds.): Petri Nets: Applications and Relationships to Other Models of Concurrency
– Brauer, Reisig, et al.
- 1987
|
|
9
|
Partial-Order Methods for the Verication of Concurrent Systems An Approach to the State-Explosion Problem, volume 1032 of LNCS
– Godefroid
- 1996
|
|
6
|
A Comparative Study of Methods for EOEcient Reachability Analysis
– Rauhamaa
- 1990
|
|
5
|
EOEcient Detection of Deadlocks in Petri Nets
– Varpaaniemi
- 1993
|
|
4
|
Defining conditional independence using collapses, Theoretical Computer Science 101
– Katz, Peled
- 1992
|
|
4
|
State Space Generation: EOEciency and Practicality
– Valmari
- 1988
|
|
4
|
Alleviating State Explosion during Verication of Behavioural Equivalence
– Valmari
- 1992
|
|
2
|
Using Partial Orders for the EOEcient Verication of Deadlock Freedom and Safety Properties
– Godefroid, Wolper
- 1993
|
|
2
|
On-the-y verication with stubborn sets
– Valmari
|
|
2
|
A Graph Model for EOEcient Reachability Analysis of Description Languages
– Valmari, Tiusanen
- 1987
|
|
2
|
Partial-Order Methods for Temporal Verication
– Wolper, Godefroid
- 1993
|
|
1
|
Rening Dependencies Improves Partial-Order Verication Methods
– Godefroid, Pirottin
|
