English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51713817      Online Users : 732
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/67386


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/67386


    Title: Segment theory to compute elementary siphons in Petri nets for deadlock control
    Other Titles: 運用分段理論計算基本虹吸在派翠網路的僵局控制
    Authors: 趙玉;陳俊廷
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: 彈性製造系統;僵局控制;派翠網路;基本虹吸;簡單的循序過程資源系統
    deadlock control;elementary siphons;flexible manufacturing systems;Petri nets;siphons;S3PR
    Date: 2012.01
    Issue Date: 2014-07-08 17:21:48 (UTC+8)
    Abstract: Unlike other techniques, Li and Zhou add control nodes and arcs for only elementary siphons greatly reducing the number of control nodes and arcs (implemented by costly hardware of I/O devices and memory) required for deadlock control in Petri net supervisors. Li and Zhou propose that the number of elementary siphons is linear to the size of the net. An elementary siphon can be synthesized from a resource circuit consisting of a set of connected segments. We show that the total number of elementary siphons, |ПE|, is upper bounded by the total number of resource places |PR | lower than that min(|P|, |T|) by Li and Zhou where |P| (|T|) is the number of places (transitions) in the net. Also, we claim that the number of elementary siphons |ПE| equals that of independent segments (simple paths) in the resource subnet of an S3PR (systems of simple sequential processes with resources). Resource circuits for the elementary siphons can be traced out based on a graph-traversal algorithm. During the traversal process, we can also identify independent segments (i.e. their characteristic T-vectors are independent) along with those segments for elementary siphons. This offers us an alternative and yet deeper understanding of the computation of elementary siphons. Also, it allows us to adapt the algorithm to compute elementary siphons in [2] for a subclass of S3PR (called S4PR) to more complicated S3PR that contains weakly dependent siphons.
    不同於其他方法 ， 李和周所提的僅為基本虹吸加入加控制節點與弧線之技術 ， 明顯地減少了派翠網路所需的監控節點和弧線。 李和周提出的虹吸技術 ， 其基本虹吸的數量與網路結構的大小呈線性關係成長。 基本虹吸可由基本資源迴圈合成 ， 迴圈又以小區塊分段方式組成。 本文提出虹吸結構總數|ПE|的上界為|PR|(資源位置數) ， 其低於最小的(|P|, |T|) ， 其中|P|和|T|各是李和周所提出網路中的操作位置(place)和轉移(transitions) 的數量。 此外 ， 我們聲稱基本虹吸的數量|ПE|等於資源子網路獨立段的數量。 基本虹吸結構在簡單的循序過程資源系統(S3PR)網路中 ， 可視為獨立區段。 一個圖的遍歷算法(graph-traversal)的基礎上 ， 可以追溯到對應於一個網路中基本虹吸的資源迴圈。 在遍歷過程中 ， 我們也可以找出獨立的區段（即 ， 其特徵T-向量都是獨立的）和對應於基本虹吸的區段。 這提供了一個替代方案深入地瞭解基本虹吸結構。 此外 ， 也能夠運用這個演算法來為S3PR的子類別(所謂S4PR) ， 與包含弱依賴虹吸更複雜的S3PR計算基本虹吸結構。
    Relation: Journal of the Chinese Institute of Industrial Engineers, 28(8), 573-585
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/10170669.2011.646324
    DOI: 10.1080/10170669.2011.646324
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    573-585.pdf522KbAdobe PDF2783View/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