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

    Title: The fundamental closed-form solution of control-related states of kth order S3PR system with left-side non-sharing resource places of Petri nets
    Authors: Chao, Daniel Yuh;Yu, Tsung Hsien
    Contributors: 資管系
    Keywords: Control systems;discrete event systems;flexible manufacturing systems;Petri nets
    Date: 2015
    Issue Date: 2015-12-10 16:16:38 (UTC+8)
    Abstract: Due to the state explosion problem, it has been unimaginable to enumerate reachable states for Petri nets. Chao broke the barrier earlier by developing the very first closed-form solution of the number of reachable and other states for marked graphs and the kth order system. Instead of using first-met bad marking, we propose ‘the moment to launch resource allocation’ (MLR) as a partial deadlock avoidance policy for a large, real-time dynamic resource allocation system. Presently, we can use the future deadlock ratio of the current state as the indicator of MLR due to which the ratio can be obtained real-time by a closed-form formula. This paper progresses the application of an MLR concept one step further on Gen-Left kth order systems (one non-sharing resource place in any position of the left-side process), which is also the most fundamental asymmetric net structure, by the construction of the system's closed-form solution of the control-related states (reachable, forbidden, live and deadlock states) with a formula depending on the parameters of k and the location of the non-sharing resource. Here, we kick off a new era of real-time, dynamic resource allocation decisions by constructing a generalisation formula of kth order systems (Gen-Left) with r* on the left side but at arbitrary locations.
    Relation: International Journal of Control
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/00207179.2015.1063164
    DOI: 10.1080/00207179.2015.1063164
    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