https://scholars.lib.ntu.edu.tw/handle/123456789/148127
標題: | Applications of conflict-free Petri nets to parallel programs and asynchronous circuits | 作者: | Yen, Hsu-Chun | 公開日期: | 四月-1992 | 起(迄)頁: | - | 來源出版物: | Eleventh Annual International Phoenix Conference on Computers and Communications, 1992 | 摘要: | 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. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-33749049466&doi=10.1109%2fPCCC.1992.200518&partnerID=40&md5=d75d94f98a8d53f1b96da1eb78f932e3 | 其他識別: | N/A | DOI: | 10.1109/PCCC.1992.200518 | SDG/關鍵字: | Asynchronous sequential logic; Petri nets; Polynomial approximation; Timing circuits; Asynchronous circuits; Conflict free; Parallel program; Polynomial-time; Race detection; Unified approach; Application programs |
顯示於: | 電機工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
00200518.pdf | 591.99 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。