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

    Title: Maximally permissive deadlock prevention via an invariant controlled method
    Authors: Liu, Gaiyun;Chao,Daniel Y.;Uzam, Murat
    Contributors: 資管系
    Keywords: deadlock prevention, FMS, Petri nets
    Date: 2012.12
    Issue Date: 2014-04-14 11:29:03 (UTC+8)
    Abstract: Recently, researchers have proposed a novel and computationally efficient method to design optimal control places and an iteration approach that computes the reachability graph once to obtain a maximally permissive, if any, liveness-enforcing supervisor of flexible manufacturing systems (FMS). The approach solves the set of integer linear inequalities to compute control places. If, given a Petri net model, no solution exists, the optimal control place does not exist for the Petri net model. We discover that a solution always exists for systems of simple sequential processes with resources (S3PR), but not for the case of FMS modelled by generalised Petri nets (GPN). We propose a theory to prove that there are no good states that will be forbidden by the control policy for S3PR, in which live and dead states cannot have the same weighted sum of tokens in the complimentary set of a siphon. For a system of simple sequential processes with general resource requirements (S3PGR2) modelled by GPN, we find the reason why the integer linear programming (ILP) may not have solutions, which is consistent with the fact that optimal supervisor synthesis for GPN remains unknown. We show that live and dead states may have the same weighted sum of tokens in the complimentary set of a siphon in a GPN. These theoretical results are verified by case studies.
    Relation: International Journal of Production Research,51(15), 4431-4442
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/00207543.2012.752590
    DOI: 10.1080/00207543.2012.752590
    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