A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q245178 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Thomas Mikosch / rank | |||
Normal rank | |||
Revision as of 18:09, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets |
scientific article |
Statements
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (English)
0 references
1991
0 references
The paper illustrates a polynomial time algorithm for which it is shown that the open \textit{M. Tiusanen's} [Bull. EATCS 36, 152-160 (1988; Zbl 0669.68046)] of determining whether two transitions in a 1-bounded conflict-free Petri net can become enabled simultaneously, is solvable in polynomial time.
0 references
concurrency
0 references
conflict-free Petri net
0 references
