Reachability Trees for High-level Petri Nets

Kurt Jensen, Arne M. Jensen, Leif Obel Jepsen, Peter Huber

    Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

    Abstract

    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
    Original languageEnglish
    JournalTheoretical Computer Science
    Volume45
    Issue3
    Pages (from-to)261-292
    Number of pages31
    ISSN0304-3975
    DOIs
    Publication statusPublished - 1986

    Fingerprint

    Dive into the research topics of 'Reachability Trees for High-level Petri Nets'. Together they form a unique fingerprint.

    Cite this