A polynomial-time algorithm to decide liveness of bounded free choice nets (Q1193656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:36, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm to decide liveness of bounded free choice nets |
scientific article |
Statements
A polynomial-time algorithm to decide liveness of bounded free choice nets (English)
0 references
27 September 1992
0 references
Petri nets
0 references
linear algebraic calculation of deadlocks and traps
0 references
polynomial time algorithm
0 references
liveness
0 references
bounded free choice nets
0 references
