Parameterized complexity and approximability of coverability problems in weighted Petri nets (Q1662545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized complexity and approximability of coverability problems in weighted Petri nets |
scientific article; zbMATH DE number 6920508
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity and approximability of coverability problems in weighted Petri nets |
scientific article; zbMATH DE number 6920508 |
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
