A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
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.
scientific article; zbMATH DE number 4213469