We studied two algorithms that compute the minimal coverability set of a Petri net. We spent most of the time understanding, reformulating and simplifying the proofs, and trying to generalize the results of the two following papers.
- P.-A. Reynier and F. Servais. Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning. In Fundamenta Informaticae 122(1-2):1-30, 2013.
- A. Valmari and H. Hansen. Old and new algorithms for minimal coverability sets. In Fundamenta Informaticae 131(1):1-25, 2014.