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

    Title: Reachability and Firing Sequences of Homogeneous Synchronized Choice Petri Nets
    Authors: 趙玉
    Chao,Daniel Yuh
    Date: 2005-01
    Issue Date: 2009-01-17 16:05:17 (UTC+8)
    Abstract: A new local structure called the Second Order Structure (SOS) has been proposed to generate a new class of nets called Synchronized Choice Nets (SNC). SNC covers well-behaved free-choice nets. The reachability problem for Homogeneous SNC (HSNC, a subclass of SNC) is quite simple because reachable markings are linearly additive and can be translated into a structural problem based on the S-Matrix. An algorithm for constructing the S-Matrix has been developed to record the structural relationships among places. Hence, it is no longer a P-Space hard problem, and an algorithm with polynomial time complexity has been developed. Also presented is an algorithm for deriving the shortest firing sequence from one reachable marking to another. How the algorithm can be extended to Inhomogeneous and non-SNC is discussed.
    Relation: Journal of Information Science and Engineering, 21(1), 129-152
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    web80.pdf21KbAdobe PDF860View/Open

    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