A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90225-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993706145 / rank | |||
Normal rank | |||
Revision as of 23:31, 19 March 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
