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


    Title: A merging method for the siphon-based FMS maximally permissive controllers with simpler structures
    Authors: Liu, G.Y.;Chao, Daniel Yuh;Uzam, M.
    趙玉
    Contributors: 資管系
    Keywords: Integer programming;Manufacture;Petri nets;Siphons;Computation burden;Deadlock;Deadlock prevention;Linear integer programming;Optimal controller;Permissive controllers;Reachability analysis;Sequential process;Flexible manufacturing systems
    Date: 2013-01
    Issue Date: 2015-05-21 17:31:43 (UTC+8)
    Abstract: It has been a hot race to design optimal controllers to be maximally permissive with fewest monitors in the shortest amount of time for flexible manufacturing systems modelled by Petri nets. Recent maximally permissive deadlock prevention controls for systems of simple sequential processes with resources reduce the computation burden by considering only a small portion of all forbidding markings and employ much fewer monitors by a linear integer programming method. Maximal permissiveness is ensured by not forbidding any live state. However, it still requires costly reachability analysis. Our previous work avoids reachability analysis by classifying siphons and adding monitors to critical siphons only. However, some live states may get lost and the number of monitors required is as many as that of critical siphons. This paper proposes a method to merge several monitors into a single one while not losing the live states. It achieves the same best results in the existing literature while avoiding the time-consuming reachability analysis which does not scale well with the large size of the nets.
    Relation: IMA Journal of Mathematical Control and Information, 31(4), 551-573
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1093/imamci/dnt029
    DOI: 10.1093/imamci/dnt029
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML451View/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