學術產出-NSC Projects

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 最小吸虹之合成
其他題名 Synthesis of Minimal Deadlocks
作者 趙玉
關鍵詞 派萃網路;彈性製造系統;死結;同步選擇
Petri nets;FMS;Deadlock;Synchronized choice
日期 2001
上傳時間 18-Apr-2007 16:40:11 (UTC+8)
Publisher 臺北市:國立政治大學資訊管理學系
摘要 Lautenbach`s marking condition for liveness [7](where all minimal siphons are invariant-controlled) has been successfully applied to FMS. However, there are two exceptions with no solutions in literatures. We have uncovered these mysteries and extends the above models to all types of resource-sharing based on the concept of synthesis of minimal siphons. Different structures in the synthesis result in different classes of nets. Each class is maximal in the sense that it covers various classes of nets in the literature. Lautenbach`s marking condition for liveness (MCL) is extended to more general cases and we are able to offer a more intuitive insight as to the structural cause for the above exceptions. It also helps to discover new TP-PT generation rules for our proprietary Knitting technique [2-3]. We have studeid each of the above maximal classes and derive its marking condition for liveness. We also propose a procedure to find the S-invariant that controls a minimal siphon.
描述 核定金額:414700元
資料類型 report
dc.coverage.temporal 計畫年度:90 起迄日期:20010801~20021031en_US
dc.creator (作者) 趙玉zh_TW
dc.date (日期) 2001en_US
dc.date.accessioned 18-Apr-2007 16:40:11 (UTC+8)en_US
dc.date.accessioned 8-Sep-2008 16:36:10 (UTC+8)-
dc.date.available 18-Apr-2007 16:40:11 (UTC+8)en_US
dc.date.available 8-Sep-2008 16:36:10 (UTC+8)-
dc.date.issued (上傳時間) 18-Apr-2007 16:40:11 (UTC+8)en_US
dc.identifier (Other Identifiers) 902213E004004.pdfen_US
dc.identifier.uri (URI) http://tair.lib.ntu.edu.tw:8000/123456789/3979en_US
dc.identifier.uri (URI) https://nccur.lib.nccu.edu.tw/handle/140.119/3979-
dc.description (描述) 核定金額:414700元en_US
dc.description.abstract (摘要) Lautenbach`s marking condition for liveness [7](where all minimal siphons are invariant-controlled) has been successfully applied to FMS. However, there are two exceptions with no solutions in literatures. We have uncovered these mysteries and extends the above models to all types of resource-sharing based on the concept of synthesis of minimal siphons. Different structures in the synthesis result in different classes of nets. Each class is maximal in the sense that it covers various classes of nets in the literature. Lautenbach`s marking condition for liveness (MCL) is extended to more general cases and we are able to offer a more intuitive insight as to the structural cause for the above exceptions. It also helps to discover new TP-PT generation rules for our proprietary Knitting technique [2-3]. We have studeid each of the above maximal classes and derive its marking condition for liveness. We also propose a procedure to find the S-invariant that controls a minimal siphon.-
dc.format applicaiton/pdfen_US
dc.format.extent bytesen_US
dc.format.extent 153777 bytesen_US
dc.format.extent 153777 bytes-
dc.format.extent 3648 bytes-
dc.format.mimetype application/pdfen_US
dc.format.mimetype application/pdfen_US
dc.format.mimetype application/pdf-
dc.format.mimetype text/plain-
dc.language zh-TWen_US
dc.language.iso zh-TWen_US
dc.publisher (Publisher) 臺北市:國立政治大學資訊管理學系en_US
dc.rights (Rights) 行政院國家科學委員會en_US
dc.subject (關鍵詞) 派萃網路;彈性製造系統;死結;同步選擇-
dc.subject (關鍵詞) Petri nets;FMS;Deadlock;Synchronized choice-
dc.title (題名) 最小吸虹之合成zh_TW
dc.title.alternative (其他題名) Synthesis of Minimal Deadlocks-
dc.type (資料類型) reporten