Parameterized complexity and approximability of coverability problems in weighted Petri nets

DOI10.1007/978-3-319-57861-3_19zbMATH Open1393.68126OpenAlexW2611685146MaRDI QIDQ1662545FDOQ1662545

Dimitri Watel, Marc-Antoine Weisser, D. Barth

Publication date: 20 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-57861-3_19

Recommendations

• Coverability synthesis in parametric Petri nets
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
• Discrete parameters in Petri nets
• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
• Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods

zbMATH Keywords

parameterized complexityapproximabilityminimum weight synthesis problemPetri net coverability problem

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)

Cited In (1)

• Directed reachability for infinite-state systems

This page was built for publication: Parameterized complexity and approximability of coverability problems in weighted Petri nets

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