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

    Title: Reachability of synchronized choice Petri nets
    Authors: Chao, Daniel Yuh
    Contributors: 資管系
    Date: 2002
    Issue Date: 2015-10-15 16:07:13 (UTC+8)
    Abstract: A new local structure called Second Order Structure (SOS) is proposed to generate a new class of nets called Synchronized Choice Nets (SNC). SNC covers well-behaved FC. Reachability is no longer a P-Space hard problem, but can be translated into a structure problem and solved with polynomial time complexity.
    Relation: IEEE International Conference on Systems, Man, and Cybernetics - SMC , vol. 6
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/ICSMC.2002.1175584
    DOI: 10.1109/ICSMC.2002.1175584
    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