scientific article; zbMATH DE number 3919829

MaRDI QIDQ3694702zbMATH OpenFDO

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

Publication date 1985

Mathematics Subject Classification ID

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

Recommendations

• Reachability trees for high-level Petri nets
• Parameterized reachability trees for algebraic Petri nets
• Hierarchical reachability graph generation for Petri nets
• On reachability graphs of Petri nets
• Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
• A structure to decide reachability in Petri nets
• Remarks on the Reachability Graphs of Petri Nets
• scientific article; zbMATH DE number 4128405
• scientific article; zbMATH DE number 50851

Cited in

(10)

• On reachability graphs of Petri nets
• Solving high-level Petri games
• scientific article; zbMATH DE number 4128405 (Why is no real title available?)
• scientific article; zbMATH DE number 1302044 (Why is no real title available?)
• scientific article; zbMATH DE number 938521 (Why is no real title available?)
• Parameterized reachability trees for algebraic Petri nets
• Symmetries in timed continuous Petri nets
• Reachability trees for high-level Petri nets
• Mathematical programming approach to the Petri nets reachability problem
• Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems

This page was built for publication:

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