Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
From MaRDI portal
Publication:2920142
DOI10.4230/LIPIcs.FSTTCS.2009.2331zbMath1248.68356OpenAlexW1559819674MaRDI QIDQ2920142
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_62aa.html
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
On selective unboundedness of VASS ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Parameterized Complexity Results for 1-safe Petri Nets
This page was built for publication: Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
