The reachability problem for object nets

MaRDI QIDQ5422285zbMATH OpenFDO

Authors Michael Köhler-Bußmeier

Publication date 17 October 2007

zbMATH Keywords

decidabilitynets within netsPetri netsreachability

Mathematics Subject Classification ID

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

Recommendations

• A survey of decidability results for elementary object systems
• Conservative elementary object systems
• Decidability of the Petri net reachability problem
• Structural and Dynamic Restrictions of Elementary Object Systems
• Applications and Theory of Petri Nets 2004

Cited in

(14)

• Boundedness of adaptive nets is decidable
• An upper bound for the reachability problem of safe, elementary hornets
• Safeness for object nets
• Liveness of safe object nets
• scientific article; zbMATH DE number 1799527 (Why is no real title available?)
• Hornets: Nets within Nets Combined with Net Algebra
• Conservative elementary object systems
• On the expressiveness of communication channels for object nets
• Complexity results for elementary Hornets
• On the complexity of the reachability problem for safe, elementary hornets
• A survey of decidability results for elementary object systems
• Decidability problems of a basic class of object nets
• Decidability and complexity of Petri nets with unordered data
• Applications and Theory of Petri Nets 2004

This page was built for publication: The reachability problem for object nets

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