A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.

Hsu-Chun Yen A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets. 71-76 1991 38 Inf. Process. Lett. 2 db/journals/ipl/ipl38.html#Yen91