In this paper we propose an efficient reachabitity 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.
CITATION STYLE
Bause, F. (1997). Analysis of petri nets with a dynamic priority method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1248, pp. 215–234). Springer Verlag. https://doi.org/10.1007/3-540-63139-9_38
Mendeley helps you to discover research relevant for your work.