Applications of conflict-free Petri nets to parallel programs and asynchronous circuits
Resource
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Journal
Eleventh Annual International Phoenix Conference on Computers and Communications, 1992
Pages
-
Date Issued
1992-04
Date
1992-04
Author(s)
DOI
N/A
Abstract
We 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.
Other Subjects
Asynchronous sequential logic; Petri nets; Polynomial approximation; Timing circuits; Asynchronous circuits; Conflict free; Parallel program; Polynomial-time; Race detection; Unified approach; Application programs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00200518.pdf
Size
591.99 KB
Format
Adobe PDF
Checksum
(MD5):3525d025eb9c82c1dccab7cffcaa77d9