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

    Title: Reachability of Non-Synchronized Choice Petri Nets and Its Applications
    Authors: 趙玉
    Chao,Daniel Yuh
    Date: 2005-12
    Issue Date: 2009-01-17 15:59:35 (UTC+8)
    Abstract: A new local structure called a second-order structure was proposed to generate a new class of nets called synchronized choice nets (SNC). SNC covers well-behaved free choice nets. Reachability is no longer P-Space hard problem, but can be solved with polynomial time complexity. How to extend them to non-SNC and its application to deadlock detection in flexible manufacturing systems are discussed.
    Relation: IEEE transactions on systems, man, and cybernetics.Part B,35(6), 1203-1213
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1109/TSMCB.2005.850171
    DOI: 10.1109/TSMCB.2005.850171
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File 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