Reachability Trees for High-level Petri Nets
High-level Petri nets have been introduced as a powerful net type by which it is possible to handle rather complex systems in a succinct and manageable way. The success of high-level Petri nets is undebatable when we speak about description, but there is still much work to be done to establish the necessary analysis methods. In other papers it is shown how to generalize the concept of place- and transition invariants from place/transition nets to high-level Petri nets. Our present paper contributes to this with a generalization of reachability trees, which is one of the other important analysis methods known for place/transition nets.
KeywordsInduction Hypothesis Transition Sequence Symmetry Type Node Label Proof Rule
Unable to display preview. Download preview PDF.
- M. Hack, Decidability questions for Petri Nets, Intern. Rept. TR 161, MIT, 1976.Google Scholar
- P. Huber, A.M. Jensen, L.O. Jepsen and K. Jensen, Towards reachability trees for high-level Petri nets, Intern. Rept. PB-174, Computer Science Dept., Univ. of Aarhus, 1985.Google Scholar
- K. Jensen, How to find invariants for coloured Petri nets, in: J. Gruska and M. Chytill, eds., Mathematical Foundations of Computer Science 1981, Lecture Notes in Computer Science 118 ( Springer, Berlin, 1981 ) 327–338.Google Scholar