Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263)
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: Reachability in live and safe free-choice Petri nets is NP-complete |
scientific article; zbMATH DE number 1190303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability in live and safe free-choice Petri nets is NP-complete |
scientific article; zbMATH DE number 1190303 |
Statements
Reachability in live and safe free-choice Petri nets is NP-complete (English)
0 references
13 August 1998
0 references
reachability
0 references
Petri nets
0 references
0.8741139
0 references
0.8715862
0 references
0.8715862
0 references
0 references
0.87050027
0 references
0.86873215
0 references
0.8681313
0 references
