Hsu-Chun Yen: A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets. (1991)
10.1016/0020-0190(91)90225-7
A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.
1
Inf. Process. Lett.
Inf. Process. Lett.
38
2
71-76
1991
provenance information for RDF data of dblp record 'journals/ipl/Yen91'
2017-05-26T22:54:41+0200