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

    Title: Control policy for a subclass of Petri nets without reachability analysis
    Authors: 趙玉
    Liu, GaiYun;Chao, Daniel Yuh;Yu, Fang
    Contributors: 資管系
    Date: 2013-08
    Issue Date: 2015-01-12 15:33:40 (UTC+8)
    Abstract: Traditional maximally permissive deadlock prevention control for flexible manufacturing systems requires costly reachability analysis. It has been a hot race to synthesise optimal controllers to be maximally permissive with fewest monitors. Previous work shows that among all n-dependent siphons, only one siphon (whose unmarked state follows some token distribution) needs to be controlled. This greatly simplifies the supervisor synthesis as well as minimises the number of monitors required while making the controlled net maximally permissive (i.e. all live states can be reached.). This study further proposes a maximally permissive control policy for a subclass of systems of simple sequential processes with resources (S3PR) based on the above theory of token distribution pattern of unmarked siphons.
    Relation: IET Control Theory and Applications,7(8),1131-1141
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1049/iet-cta.2012.0426
    DOI: 10.1049/iet-cta.2012.0426
    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