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

DOI10.1007/978-3-319-07734-5_17MaRDI QIDQ5166771zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 17543 (Why is no real title available?)
• scientific article; zbMATH DE number 3582425 (Why is no real title available?)
• scientific article; zbMATH DE number 1059894 (Why is no real title available?)
• scientific article; zbMATH DE number 4001487 (Why is no real title available?)
• scientific article; zbMATH DE number 827979 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A note on transition systems
• An Algorithm for the General Petri Net Reachability Problem
• 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
• Complexity of some problems in Petri nets
• On reachability equivalence for BPP-nets
• Termination Properties of Generalized Petri Nets
• The complexity of the word problems for commutative semigroups and polynomial ideals

Cited in

(6)

• Parameterized Analysis of Immediate Observation Petri Nets
• Completeness results for generalized communication-free Petri nets with arbitrary arc multiplicities
• Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
• The complexity of problems involving structurally bounded and conservative Petri nets
• The complexity of soundness in workflow nets
• scientific article; zbMATH DE number 176140 (Why is no real title available?)

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)