A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets (Q809611)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4213469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets |
scientific article; zbMATH DE number 4213469 |
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
0 references
0.7593498826026917
0 references
0.7563920617103577
0 references
0.7531666159629822
0 references
0.7528208494186401
0 references
