Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
DOI10.1007/978-3-642-38697-8_5zbMath1381.68213OpenAlexW103976318MaRDI QIDQ5300866
Jeremias Weihmann, Ernst W. Mayr
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
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
