A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
DOI10.1007/978-3-319-07734-5_17zbMATH Open1410.68257OpenAlexW100061349MaRDI QIDQ5166771FDOQ5166771
Authors: 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
Recommendations
- The complexity of problems involving structurally bounded and conservative Petri nets
- scientific article; zbMATH DE number 1555184
- On the reachability and reversibility problems in a class of Petri nets
- scientific article; zbMATH DE number 13472
- scientific article; zbMATH DE number 1973123
- A Note on Persistent Petri Nets
- scientific article; zbMATH DE number 3932401
- Petri nets. Theoretical models and analysis methods for concurrent systems
- scientific article; zbMATH DE number 1101600
- On the finite containment problem for Petri nets
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- The complexity of the word problems for commutative semigroups and polynomial ideals
- An Algorithm for the General Petri Net Reachability Problem
- Title not available (Why is that?)
- Complexity of some problems in Petri nets
- Title not available (Why is that?)
- Termination Properties of Generalized Petri Nets
- A note on transition systems
- Completeness results for conflict-free vector replacement systems
- Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
- Completeness results for single-path Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On reachability equivalence for BPP-nets
Cited In (6)
- Parameterized Analysis of Immediate Observation Petri Nets
- Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
- Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities
- The complexity of soundness in workflow nets
- The complexity of problems involving structurally bounded and conservative Petri nets
- Title not available (Why is that?)
This page was built for publication: A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166771)
