Commodification of accelerations for the Karp and Miller Construction
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...
Saved in:
Published in | Discrete event dynamic systems Vol. 31; no. 2; pp. 251 - 270 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.06.2021
Springer Nature B.V Springer Verlag |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!