Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE

DOI10.4230/LIPICS.FSTTCS.2009.2331MaRDI QIDQ2920142zbMATH OpenOpenAlexFDO

Authors M. Praveen, Kamal Lodaya

Publication date 24 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_62aa.html

zbMATH Keywords

boundednessPetri netscoverabilityparaPSPACE

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Parameterized Complexity Results for 1-safe Petri Nets
• Discrete parameters in Petri nets
• Efficient algorithms for three reachability problems in safe Petri nets

Cited in

(3)

• Parameterized Analysis of Immediate Observation Petri Nets
• Parameterized Complexity Results for 1-safe Petri Nets
• On selective unboundedness of VASS

This page was built for publication: Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE

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