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

    Title: Enumeration of Reachable States for Arbitrary Marked Graphs
    Authors: Hong, Liang;Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: LISTS;GRAPH theory;PETRI nets;INFORMATION resources;INFORMATION storage & retrieval systems;COMBINATORIAL analysis
    Date: 2012.07
    Issue Date: 2014-03-31 16:36:50 (UTC+8)
    Abstract: This study develops the theory to enumerate the reachable states of marked graphs that are a simple subclass of Petri nets where every place has a single input and output transition without the construction of a reachability graph (RG), which, as far as the authors know, does not receive much attention in the previous studies. Usually, it is necessary to enumerate all the reachable states of a plant to be controlled. However, the construction of an RG suffers from the state explosion problem. This study tackles the problem for a special class of Petri nets by expressing and finding the number of reachable states in an algebraic way. [ABSTRACT FROM AUTHOR]
    Relation: IET CONTROL THEORY AND APPLICATIONS,6(10), 1536 -1543
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1049/iet-cta.2011.0491
    DOI: 10.1049/iet-cta.2011.0491
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1545.pdf343KbAdobe PDF859View/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