Parameterized complexity and approximability of coverability problems in weighted Petri nets (Q1662545)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity and approximability of coverability problems in weighted Petri nets |
scientific article |
Statements
Parameterized complexity and approximability of coverability problems in weighted Petri nets (English)
0 references
20 August 2018
0 references
Petri net coverability problem
0 references
minimum weight synthesis problem
0 references
parameterized complexity
0 references
approximability
0 references
