On the Complexity of the Reachability Problem for Safe, Elementary Hornets

DOI10.3233/FI-2014-963zbMath1328.68137OpenAlexW1616310043MaRDI QIDQ5411675

Michael Köhler-Bußmeier

Publication date: 25 April 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2014-963

zbMATH Keywords

reachabilitysafenesshornetsnets-within-netsobject nets

Mathematics Subject Classification ID

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

Related Items (2)

Complexity Results for Elementary Hornets ⋮ Modular rewritable Petri nets: an efficient model for dynamic distributed systems

This page was built for publication: On the Complexity of the Reachability Problem for Safe, Elementary Hornets