Complexity Results for Elementary Hornets

DOI10.1007/978-3-642-38697-8_9zbMath1381.68207OpenAlexW2111214092MaRDI QIDQ5300870

Frank Heitmann, Michael Köhler-Bußmeier

Publication date: 28 June 2013

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_9

zbMATH Keywords

reachabilitysafenessnets-within-netsobject netsHornets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Modular rewritable Petri nets: an efficient model for dynamic distributed systems

Cites Work

• Petri nets and algebraic specifications
• Safeness for Object Nets
• Hornets: Nets within Nets Combined with Net Algebra
• On the Complexity of the Reachability Problem for Safe, Elementary Hornets
• Nested Petri Nets for Adaptive Process Modeling
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity Results for Elementary Hornets