English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51713840      Online Users : 742
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/53427


    Title: S3PR的N-依賴虹吸管的可控性
    Other Titles: Controllability of N-Dependent Siphons in an S3pr
    Authors: 趙玉
    Contributors: 國立政治大學資訊管理學系
    行政院國家科學委員會
    Keywords: 虹吸管
    Date: 2011
    Issue Date: 2012-08-30 15:49:00 (UTC+8)
    Abstract: 彈性製造系統(FMS)患有死鎖否定自動化的優點。為了防止死鎖的發生,監視器(招致硬件成本)往往添加到虹吸管使他們總是有足夠標記。原Petri網模型被干擾以致一些好的狀態不再可以實現的。最大許可和使用最少的監控的最佳合成控制器一直是一個熱門的競賽。李和周提出簡單的Petri網控制器將可空虹吸管分為兩組:基本和依賴性,只對基本信標增加監視器。在先前的文章中,我們發現,在所有2依賴虹吸管(取決於兩個基本信標),只有一個虹吸管需要被控制,增加了監測。這大大簡化了合成以及顯示器的數量降到最低要求,同時使控制網達到最大許可。這一建議擴展到n的依賴虹吸管, n >2。初步,我們努力表明,在所有相關的N虹吸依賴虹吸秒,只有一台顯示器(初始標識等於在S總記號減 1,進一步減額M0(r)= 1的總數)是必需的,並確定了相應的虹吸管。這不僅降低了增加的顯示器硬件成本和簡化了結構複雜,而且也便於識別的設計需要一個虹吸監控每個 n-依賴的虹吸管。此外,它藉由最大允許的方式加入每個監視器維持最大的行為許可。
    Flexible Manufacturing System (FMS) suffers from deadlocks negating the advantages of automation. To prevent deadlocks from occurring, monitors (incurring hardware cost) are often added to siphons for them to be always sufficiently marked. The original Petri net model gets disturbed and some good states are no longer attainable. It has been a hot race to synthesize optimal controllers to be maximally permissive and using fewest monitors. Li and Zhou propose simpler Petri net controllers by dividing emptiable siphons into two groups: elementary and dependent and adding monitors for elementary siphons only. In an earlier paper, we showed that among all 2-dependent siphons (depending on two elementary siphons), only one siphon needs to be controlled by adding a monitor. This greatly simplifies the synthesis as well as minimizes the number of monitors required while making the control net maximally permissive. This proposal extends the result to n-dependent siphons with n>2. Preliminarily, we strive to show that among all siphons associated with an n-dependent siphon S, only one monitor (with initial marking equals the total number of tokens in S minus 1 and further minus the total number of resource places r with M0(r)=1)is required and identified the corresponding emptiable siphon. This not only reduces the hardware cost of adding monitors and simplifies the structural complexity, but also facilitates the design by identifying the siphon that needs a monitor for each n-dependent siphon. In addition, it maintains the behavior permissiveness by adding each monitor in a maximally permissive manner.
    Relation: 基礎研究
    學術補助
    研究期間:10008~ 10107
    研究經費:310仟元
    Data Type: report
    Appears in Collections:[資訊管理學系] 國科會研究計畫

    Files in This Item:

    File Description SizeFormat
    100-2221-E-004-001.pdf708KbAdobe PDF2614View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 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 ©   - Feedback