Reachability in live and safe free-choice Petri nets is NP-complete (Q1129263): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:10, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability in live and safe free-choice Petri nets is NP-complete |
scientific article |
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
