A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993)
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: A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming |
scientific article; zbMATH DE number 92070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming |
scientific article; zbMATH DE number 92070 |
Statements
A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (English)
0 references
16 January 1993
0 references
concurrency
0 references
covering problem
0 references
1-bounded conflict-free Petri nets
0 references
linear programming
0 references
0 references
0.8221465349197388
0 references
0.7832163572311401
0 references
0.7790272831916809
0 references
0.770542562007904
0 references
0.7655418515205383
0 references
