English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93980/124435 (76%)
Visitors : 29053093      Online Users : 324
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/79666
    Please use this identifier to cite or link to this item: http://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

    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