Parameterized complexity and approximability of coverability problems in weighted Petri nets

DOI10.1007/978-3-319-57861-3_19zbMath1393.68126OpenAlexW2611685146MaRDI QIDQ1662545

Dimitri Watel, Marc-Antoine Weisser, Dominique Barith

Publication date: 20 August 2018

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

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)

Related Items (1)

Directed reachability for infinite-state systems

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