A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application

DOI10.1007/978-3-319-07734-5_17zbMath1410.68257OpenAlexW100061349MaRDI QIDQ5166771

Ernst W. Mayr, Jeremias Weihmann

Publication date: 8 July 2014

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-319-07734-5_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Parameterized Analysis of Immediate Observation Petri Nets, Computational Complexity of Atomic Chemical Reaction Networks

Cites Work

• Completeness results for single-path Petri nets
• A new polynomial-time algorithm for linear programming
• Completeness results for conflict-free vector replacement systems
• A note on transition systems
• Complexity of some problems in Petri nets
• On reachability equivalence for BPP-nets
• The complexity of the word problems for commutative semigroups and polynomial ideals
• An Algorithm for the General Petri Net Reachability Problem
• Termination Properties of Generalized Petri Nets
• Completeness Results for Generalized Communication-Free Petri Nets with Arbitrary Edge Multiplicities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item