English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88531/118073 (75%)
Visitors : 23458548      Online Users : 134
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/74637
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/74637


    Title: A control policy for γ-nets without reachability analysis and siphon enumeration
    Authors: Wu, W.;Chao, D.Y.;Yu, Fang
    郁方
    Contributors: 資管系
    Keywords: Control policy;Deadlock prevention;Optimal controller;Permissive controllers;Reachability analysis;Research topics;Sequential process;Flexible manufacturing systems;Petri nets;Siphons;Controllers
    Date: 2013
    Issue Date: 2015-04-16 17:36:35 (UTC+8)
    Abstract: Synthesizing maximally permissive controllers with fewest monitors has been a popular research topic. Current optimal controllers for large flexible manufacturing systems (FMS) require costly time consuming reachability analysis. Our previous work shows that among all n-dependent siphons, only one siphon (whose unmarked state follows specific token distribution) needs to be controlled. This greatly simplifies the synthesis as well as minimizes the number of monitors required while making the controlled net nearly maximally permissive. However, some live states may get lost. To reach more live states, the controller regions must be refined to be less affected or disturbed by the monitors and their controlled arcs. We observe that the markings of all the resulting controller regions follow a simple pattern. Based on this pattern of unmarked siphons, this paper further proposes a maximally permissive control policy for a subclass of S3PR (Systems of Simple Sequential Processes with Resources). © 2013 IEEE.
    Relation: IEEE International Conference on Automation Science and Engineering,2013, 論文編號 6653897, Pages 1133-1138, Madison, WI; United States; 17 August 2013 到 20 August 2013; 代碼 101740
    10.1109/CoASE.2013.6653897
    Data Type: conference
    Appears in Collections:[資訊管理學系] 會議論文

    Files in This Item:

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