Commodification of accelerations for the Karp and Miller Construction

• Published in: Discrete event dynamic systems Vol. 31; no. 2; pp. 251 - 270
• Main Authors: Finkel, Alain, Haddad, Serge, Khmelnitsky, Igor
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.06.2021; Springer Nature B.V; Springer Verlag
• Subjects: Algorithms; Computer Science; Control; Convex and Discrete Geometry; Electrical Engineering; Machines; Manufacturing; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Petri nets; Processes; Systems Theory; Topical Collection on Recent Trends in Reactive Systems; Petri nets; Verification tool; Coverability; Minimal coverability set; Minimal coverability tree; Karp-Miller tree algorithm; Clover

Karp and Miller’s algorithm is based on an exploration of the reachability tree of a Petri net where, the sequences of transitions with positive incidence are accelerated. The tree nodes of Karp and Miller are labeled with ω -markings representing (potentially infinite) coverability sets. This set o...