Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets

DOI10.1007/978-3-642-38697-8_5MaRDI QIDQ5300866zbMATH OpenOpenAlexFDO

Authors Ernst W. Mayr, Jeremias Weihmann

Publication date 28 June 2013

Published in Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL http://mediatum.ub.tum.de/doc/1140455/document.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On reachability equivalence for BPP-nets
• Complexity results for problems of communication-free Petri nets and related formalisms
• scientific article; zbMATH DE number 1555184
• scientific article; zbMATH DE number 4037227
• The complexity of problems involving structurally bounded and conservative Petri nets

Cited in

(4)

• A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
• On reachability equivalence for BPP-nets
• Bounded model checking liveness on basic parallel processes
• On Compositionality of Boundedness and Liveness for Nested Petri Nets

This page was built for publication: Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300866)