A generalization of the procedure of Karp and Miller to well structured transition systems
14th International Colloquium on Automata, languages and programming
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Covering sharing trees: a compact data structure for parameterized verification
International Journal on Software Tools for Technology Transfer (STTT)
Incremental construction of coverability graphs
Information Processing Letters
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Journal of Computer and System Sciences
Minimal coverability set for petri nets: Karp and Miller algorithm with pruning
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Old and new algorithms for minimal coverability sets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Hi-index | 0.00 |
Many algorithms for computing minimal coverability sets for Petri nets prune futures. That is, if a newmarking strictly covers an old one, then not just the old marking but also some subset of its successor markings is discarded from search. In this publication, a simpler algorithm that lacks future pruning is presented and proven correct. Its performance is compared with future pruning. It is demonstrated, using examples, that neither approach is systematically better than the other. However, the simple algorithm has some attractive features. It never needs to re-construct pruned parts of the minimal coverability set. It automatically gives most of the advantage of future pruning, if the minimal coverability set is constructed in depth-first or most tokens first order, and if so-called history merging is applied. Some implementation aspects of minimal coverability set construction are also discussed. Some measurements are given to demonstrate the effect of construction order and other implementation aspects.