政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/61579
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113392/144379 (79%)
造訪人次 : 51217424      線上人數 : 888
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/61579


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/61579


    題名: Improved Controllability Test for Dependent Siphons in S3PR Based on Elementary Siphons
    作者: 趙玉
    Chao,Daniel Y.
    貢獻者: 資管系
    關鍵詞: Petri nets;siphons;controllability;FMS;S3PR
    日期: 2010.05
    上傳時間: 2013-11-11 15:45:21 (UTC+8)
    摘要: When siphons in a flexible manufacturing system (FMS) modeled by an ordinary Petri net (OPN) become unmarked, the net gets deadlocked. To prevent deadlocks, some control places and related arcs are added to strict minimal siphons (SMS) so that no siphon can be emptied. For large systems, it is infeasible to add a monitor to every SMS since the number of SMS or control elements grows exponentially with respect to the size of a Petri net. To tackle this problem, Li and Zhou propose to add control nodes and arcs for only elementary siphons. The rest of siphons, called dependent ones, may be controlled by adjusting control depth variables of elementary siphons associated with a dependent siphon after the failure of two tests. First, they test a Marking Linear Inequality (MLI); if it fails, then they perform a Linear Integer Programming (LIP) test which is an NP-hard problem. This implies that the MLI test is only sufficient, but not necessary. We propose a sufficient and necessary test for adjusting control depth variables in an S3PR to avoid the sufficient-only time-consuming linear integer programming (LIP) test (NP-complete problem) required previously for some cases. We theoretically prove the following: i) no need for LIP test for Type II siphons; and ii) Type I strongly n-dependent (n>2) siphons being always marked. As a result, the total time complexity to check controllability of all strongly dependent siphons is no longer exponential but reduced to linear if all siphons are of Type I. The total time complexity is O(|ΠE||ΠD|) (order of the product of total number of elementary siphons and total number of dependent siphons) if all siphons are of Type II. A well-known S3PR example has been illustrated to show the advantages.
    關聯: Asian Journal of Control, 12(3) , 377-391
    資料類型: article
    DOI 連結: http://dx.doi.org/10.1002/asjc.217
    DOI: 10.1002/asjc.217
    顯示於類別:[資訊管理學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    377391.pdf429KbAdobe PDF21057檢視/開啟


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


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋