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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7659651637077332
0 references
0.7539522647857666
0 references
0.7293837666511536
0 references
0.7288243770599365
0 references
0.7182040810585022
0 references
