Reachability Trees for High-level Petri Nets

  • P. Huber
  • A. M. Jensen
  • L. O. Jepsen
  • K. Jensen


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.


Induction Hypothesis Transition Sequence Symmetry Type Node Label Proof Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H.J. Genrich and K. Lautenbach, System modelling with high-level Petri nets, Theoret. Comput. Sci. 13 (1981) 109–136.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    M. Hack, Decidability questions for Petri Nets, Intern. Rept. TR 161, MIT, 1976.Google Scholar
  3. [3]
    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
  4. [4]
    K. Jensen, Coloured Petri nets and the invariant-method, Theoret. Comput. Sci. 14 (1981) 317–336.zbMATHGoogle Scholar
  5. [5]
    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
  6. [6]
    K. Jensen, High-level Petri nets, in: A. Pagnoni and G. Rozenberg, eds., Applications and Theory of Petri Nets, Informatik-Fachberichte 66 ( Springer, Berlin, 1983 ) 166–180.CrossRefGoogle Scholar
  7. [7]
    R.M. Karp and R.E. Miller, Parallel program schemata, J. Comput. System Sci. 3 (1969) 147–195.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [8]
    J.L. Peterson, Petri Net Theory and the Modelling of Systems ( Prentice-Hall, Englewood Cliffs, NJ, 1981 ).zbMATHGoogle Scholar
  9. [9]
    W. Reisig, Petri nets with individual tokens, in: A. Pagnoni and G. Rozenberg, eds., Applications and Theory of Petri Nets, Informatik-Fachberichte 66 (Springer, Berlin, 1983 ) 229–249.CrossRefGoogle Scholar

Copyright information

© Elsevier Science Publishers B.V. 1986

Authors and Affiliations

  • P. Huber
  • A. M. Jensen
  • L. O. Jepsen
  • K. Jensen

There are no affiliations available

Personalised recommendations