The reachability problem for object nets

zbMATH Open1124.68071MaRDI QIDQ5422285FDOQ5422285

Authors Michael Köhler-Bußmeier 

Publication date 17 October 2007

zbMATH Keywords

reachabilitydecidabilityPetri netsnets within nets

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)

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

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)