Dept. of Electr. Eng., National Taiwan Univ.Yen, Hsu-ChunHsu-ChunYen2007-04-192018-07-062007-04-192018-07-061992-04https://www.scopus.com/inward/record.uri?eid=2-s2.0-33749049466&doi=10.1109%2fPCCC.1992.200518&partnerID=40&md5=d75d94f98a8d53f1b96da1eb78f932e3We propose a unified approach for dealing with the race detection problem for two entirely different models, namely, parallel programs and asynchronous circuits. We first show that the problem of determining whether two transitions in a l-bounded conflict-free Petri net call become enabled simultaneously is solvable in polynomial time. (This will be referred to as the pairwise concurrency problem.) We then show that the race detection problem for parallel programs (asynchronous circuits) and the pairwise concurrency problem for Petri nets are closely related to each other. As a result, race conditions can be detected efficiently (i.e., in polynomial time) for those parallel programs and asynchronous circuits that can be modeled by l-bounded conflict-free Petri nets. Since most problems concerning Petri nets are very difficult to solve, our polynomial time result is of interest and significance in its own right. © 1992 IEEE.application/pdf606200 bytesapplication/pdfen-USAsynchronous sequential logic; Petri nets; Polynomial approximation; Timing circuits; Asynchronous circuits; Conflict free; Parallel program; Polynomial-time; Race detection; Unified approach; Application programsjournal article10.1109/PCCC.1992.2005182-s2.0-33749049466http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910032302/1/00200518.pdf