English  |  正體中文  |  简体中文  |  Items with full text/Total items : 87250/116256 (75%)
Visitors : 23281695      Online Users : 289
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/111686
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/111686


    Title: On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Iterative methods;Petri nets;Siphons;Supervisory personnel;Computationally efficient;Controlled system;Deadlock prevention;Liveness-enforcing supervisor;Lower bounds;Optimal controls;Reachability graphs;Sequential process;Flexible manufacturing systems
    Date: 2015-01
    Issue Date: 2017-08-09 17:18:20 (UTC+8)
    Abstract: Recently, a novel and computationally efficient method-based on a vector covering approach-to design optimal control places and an iteration approach that computes the reachability graph to obtain a maximally permissive liveness enforcing supervisor for FMS (flexible manufacturing systems) have been reported. However, it is unclear as to the relationship between the structure of the net and the minimal number of monitors required. This paper develops a theory to show that the minimal number of monitors required cannot be less than that of basic siphons in α-S3PR (systems of simple sequential processes with resources). This confirms that two of the three controlled systems by Chen et al. are of a minimal monitor configuration since they belong to α-S3PR and their number in each example equals that of basic siphons. © 2013 Taylor and Francis.
    Relation: International Journal of Systems Science, 46(2), 332-339
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/00207721.2013.783946
    DOI: 10.1080/00207721.2013.783946
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML130View/Open


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


    社群 sharing

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