English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113318/144297 (79%)
Visitors : 51056641      Online Users : 927
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/79666


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


    Title: Closed-form solution of controller synthesis for infinitely large systems of resource sharing systems of a subclass of Petri nets
    Authors: Chao, Daniel Y
    趙玉
    Contributors: 資訊管理學系
    Date: 2015
    Issue Date: 2015-12-15 17:57:09 (UTC+8)
    Abstract: Little literature has dealt with infinite systems where an arbitrarily large number of resources is shared between larger systems with many stages due to the associated state explosion problem. Current most advanced controlled techniques for flexible manufacturing systems (FMS) cannot handle very large systems. We proposed earlier a method without reachability analysis to find the closed-form solutions of all reachable, forbidden, and live markings for the so-called kth-order system. This is the first reported closed-form solution of arbitrarily large systems. This paper further extends the closed-form solutions to the controller synthesis of infinite kth-order systems, which is a subclass of FMS. The place-invariant-based deadlock prevention controls are adopted to reduce the computational burden by considering only the minimal set of all first-met bad markings (FBMs). No live states are lost by considering also only the minimal set of all live markings. The above requires solving integer linear programming problems (ILPPs), which is NP-hard and quite time-consuming. By merging several monitors into a single one while not losing live states, this paper is able to achieve the same best results in the literature while avoiding the time-consuming reachability analysis and complete siphon computation which does not scale well with the size of the nets. Furthermore, closed-form solution of arbitrarily large systems can be derived, which has never been attained so far. Application to large Gadara resource allocation systems is also mentioned. Further work on handling a very large system with resources shared between more than two processes is reported. Moreover, the initial markings of the two terminal resource places are allowed to vary above one.
    Relation: Transactions of the Institute of Measurement and Control
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1177/0142331214564010
    DOI: 10.1177/0142331214564010
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

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