政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/27046
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 94890/125432 (76%)
造訪人次 : 30649615      線上人數 : 333
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/27046
    請使用永久網址來引用或連結此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/27046


    題名: A Graphic-Algebraic Computation of Elementary Siphons of BS3PR
    作者: 趙玉
    Chao,Daniel Yuh
    關鍵詞: flexible manufacturing systems;deadlock control;Petri nets;siphons;elementary siphons;S3PR
    日期: 2007-01
    上傳時間: 2009-01-17 16:05:22 (UTC+8)
    摘要: Unlike other techniques, Li et al. add control nodes and arcs for only elementary siphons, thus reducing the number of control nodes and arcs required for deadlock control in Petri net supervisors. Their method suffers from the expensive computation of all SMS (Strict Minimal Siphons). We propose a graphic-algebra approach to compute elementary siphons without the knowledge of SMS. We show that each SMS corresponds to a strongly connected resource subnet (sub-SCC) whose characteristic T-vector ζ can be computed as a linear sum of that of all resource places in the subnet. An SMS includes all resource places in the subnet plus all input operation places of transitions with positive components in ζ. We propose Algorithm 2 to find all sub-SCC. We prove that any sub-SCC N’, containing an elementary resource circuit c as a proper subset and N’ =N” ∪ c, N” ∩ c = {r}, corresponds to a dependent siphon. Hence, elementary siphons are closely related to (and can be constructed from) elementary (called basic) circuits and in general, combinations of elementary circuits may contribute to elementary siphons. For a simple basic subclass of S3PR (called BS3PR), the set of elementary siphons is identical to that synthesized from elementary (basic) circuits. As a result, we simplify Algorithm 2 to find all elementary circuits. It is more efficient than traditional algorithms by terminating earlier upon detecting that the net is not a BS3PR.
    關聯: Journal of Information Science and Engineering, 23(6), 1817-1831
    資料類型: article
    顯示於類別:[資訊管理學系] 期刊論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    web81.pdf60KbAdobe PDF868檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋