Yen, Hsu-ChunHsu-ChunYen2009-03-042018-07-062009-03-042018-07-062002https://www.scopus.com/inward/record.uri?eid=2-s2.0-0037161307&doi=10.1016%2fS0167-6911%2801%2900196-7&partnerID=40&md5=cd5fee2416e7b203fc0a4ead288d9160We propose a novel valuation-based approach for analyzing conflict-free Petri nets. The basic idea is to associate a natural number, called the valuation, to each marking in the Petri net. If the set of markings of zero valuation is forward closed, then the valuation along any Petri net computation is nonincreasing, and in many cases, has the tendency to move towards zero valuation. Using the valuation-based method, we demonstrate a number of problems for conflict-free Petri nets to be decidable. © 2001 Elsevier Science B.V. All rights reserved.application/pdf181133 bytesapplication/pdfen-USControllability; Decidability; Fairness; Petri net; Reachability analysisComputability and decidability; Controllability; Problem solving; Reachability analysis; Petri netsjournal article10.1016/S0167-6911(01)00196-72-s2.0-0037161307http://ntur.lib.ntu.edu.tw/bitstream/246246/142316/1/14.pdf