The synthesis problem for elementary net systems is NP-complete (Q1389765)
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: The synthesis problem for elementary net systems is NP-complete |
scientific article; zbMATH DE number 1170402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The synthesis problem for elementary net systems is NP-complete |
scientific article; zbMATH DE number 1170402 |
Statements
The synthesis problem for elementary net systems is NP-complete (English)
0 references
30 June 1998
0 references
Petri net
0 references
synthesis problem
0 references
0.8824965953826904
0 references
0.872833251953125
0 references
0.8566482663154602
0 references
