English  |  正體中文  |  简体中文  |  Items with full text/Total items : 86587/115300 (75%)
Visitors : 23179241      Online Users : 565
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
    index.html0KbHTML454View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback