Reachability trees for high-level Petri nets

DOI10.1016/0304-3975(86)90046-0MaRDI QIDQ579940zbMATH OpenOpenAlexFDO

Authors Arne M. Jensen, Leif O. Jepsen, Kurt Jensen, Peter J. Huber

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90046-0

zbMATH Keywords

high-level Petri netsreachability trees

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

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.

Cites work

• Coloured Petri nets and the invariant-method
• scientific article; zbMATH DE number 3825181 (Why is no real title available?)
• scientific article; zbMATH DE number 3825182 (Why is no real title available?)
• scientific article; zbMATH DE number 3919829 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 3742638 (Why is no real title available?)
• Parallel program schemata
• System modelling with high-level Petri nets

Cited in

(11)

• A symbolic reachability graph for coloured Petri nets
• Fifo nets without order deadlock
• Solving high-level Petri games
• scientific article; zbMATH DE number 3919829 (Why is no real title available?)
• scientific article; zbMATH DE number 4128405 (Why is no real title available?)
• scientific article; zbMATH DE number 1302044 (Why is no real title available?)
• Approximating the buffer allocation problem using epochs
• scientific article; zbMATH DE number 1956601 (Why is no real title available?)
• scientific article; zbMATH DE number 938521 (Why is no real title available?)
• Symbolic reachability graph and partial symmetries
• Parameterized reachability trees for algebraic Petri nets

This page was built for publication: Reachability trees for high-level Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579940)