On Computing Symmetries and Stubborn Sets (1994) [1 citations — 1 self]
Download:
|
|
by Kimmo Varpaaniemi, Kimmo Varpaaniemi
Helsinki University of Technology
http://www.tcs.hut.fi/pub/Publications/reports/B12.ps.Z
Add To MetaCart
Abstract:
Abstract: In this report, we consider two promising methods for alleviating the state space explosion problem in reachability analysis: the symmetry method and the stubborn set method. We concentrate on the computation of symmetries and stubborn sets. The new algorithms presented in this report help us to save time and space in the symmetry method and to avoid inspecting redundant states in the so called CFFD-preserving stubborn set method. Keywords: reachability analysis, symmetry method, stubborn set method, CFFDsemantics, place/transition nets
Citations
| 469 | nets: an introduction – Petri - 1985 |
| 50 | Reachability trees for high-level Petri nets – Huber, Jensen, et al. - 1986 |
| 38 | Reachability Analysis of Petri Nets Using Symmetries,” Syst – Starke - 1991 |
| 19 | The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic – Kaivola, Valmari - 1992 |
| 13 | Eliminating redundant interleavings during concurrent program verification – Valmari - 1989 |
| 12 | How to calculate symmetries of Petri nets – Schmidt - 1997 |
| 5 | EOEcient Detection of Deadlocks in Petri Nets – Varpaaniemi - 1993 |
| 4 | State Space Generation: EOEciency and Practicality – Valmari - 1988 |
| 4 | Alleviating State Explosion during Verication of Behavioural Equivalence – Valmari - 1992 |
