Complexity results for elementary Hornets
From MaRDI portal
Recommendations
Cites work
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Hornets: Nets within Nets Combined with Net Algebra
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 2064467 (Why is no real title available?)
- Lectures on Concurrency and Petri Nets
- Liveness of safe object nets
- Nested Petri Nets for Adaptive Process Modeling
- On the complexity of the reachability problem for safe, elementary hornets
- On the expressiveness of communication channels for object nets
- Petri nets and algebraic specifications
- Safeness for object nets
- The reachability problem for object nets
Cited in
(5)- Restricting \textsc{Hornets} to support self-adaptive systems
- An upper bound for the reachability problem of safe, elementary hornets
- Hornets: Nets within Nets Combined with Net Algebra
- On the complexity of the reachability problem for safe, elementary hornets
- Modular rewritable Petri nets: an efficient model for dynamic distributed systems
This page was built for publication: Complexity results for elementary Hornets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300870)