A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets

Yen, Hsu-ChunHsu-ChunYen2009-03-042018-07-062009-03-042018-07-061991http://ntur.lib.ntu.edu.tw//handle/246246/142305application/pdf693643 bytesapplication/pdfen-USA polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri netsjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/142305/1/03.pdf