In: Azéma, P.; Balbo, G.: Lecture Notes in Computer Science, Vol. 1248: 18th International Conference on Application and Theory of Petri Nets, Toulouse, France, June 1997, pages 215-234. Berlin, Germany: Springer-Verlag, June 1997.
Abstract: In this paper we propose an efficient reachability set based Petri net analysis by introducing dynamic priorities which decreases the number of reachable markings in most cases. It is proved that for specific dynamic priority relations certain properties (especially liveness and the existence of home states) do hold if and only if these properties do also hold for the Petri net without priorities. We present an algorithm based on these priority relations additionally exploiting T-invariants thus being able to benefit from the structure of the net.