Efficient Detection of Deadlocks in Petri Nets
|
Abstract:
Abstract: Reachability analysis is a powerful formal method for analysis of concurrent and distributed finite state systems. It suffers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This report 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. What makes deadlocks especially interesting is the fact that the verification of a safety property can often be reduced to deadlock detection. The considered methods utilize the independence of transitions to cut down on the number of states inspected during the search. These methods have been combined by Godefroid, Pirottin, and Wolper to further reduce the number of inspected states. Petri nets are a widely used model for concurrent and distributed systems. This report shows that the stubborn set method and the sleep set method can be combined without any of the assumptions previously placed on the stubborn sets as far as the detection of reachable terminal states in place/transition nets, a class of Petri nets, is concerned. The obtained result is actually more general and gives a sufficient condition for a method to
Citations
| 56 | Transformations and decompositions of nets – Berthelot - 1987 |
| 16 | Formalization of Properties of Parallel Programs – Ashcroft, Manna - 1971 |
| 9 | Eds.): Petri Nets: Applications and Relationships to Other Models of Concurrency – Brauer, Reisig, et al. - 1987 |
| 7 | Reduction of Petri-Nets – Berthelot, Roucairol - 1976 |
| 6 | Eds.): Petri Nets: Central Models and Their Properties – Brauer, Reisig, et al. - 1987 |
