English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93861/124308 (76%)
Visitors : 28941103      Online Users : 431
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
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/27046
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/27046

    Title: A Graphic-Algebraic Computation of Elementary Siphons of BS3PR
    Authors: 趙玉
    Chao,Daniel Yuh
    Keywords: flexible manufacturing systems;deadlock control;Petri nets;siphons;elementary siphons;S3PR
    Date: 2007-01
    Issue Date: 2009-01-17 16:05:22 (UTC+8)
    Abstract: 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.
    Relation: Journal of Information Science and Engineering, 23(6), 1817-1831
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    web81.pdf60KbAdobe PDF868View/Open

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback