| dc.contributor | 資管系 | en_US |
| dc.creator (作者) | Hong, Liang ;Chao, Daniel Yuh | en_US |
| dc.creator (作者) | 趙玉 | - |
| dc.date (日期) | 2012.07 | en_US |
| dc.date.accessioned | 31-Mar-2014 16:36:50 (UTC+8) | - |
| dc.date.available | 31-Mar-2014 16:36:50 (UTC+8) | - |
| dc.date.issued (上傳時間) | 31-Mar-2014 16:36:50 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/65037 | - |
| dc.description.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] | en_US |
| dc.format.extent | 352187 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IET CONTROL THEORY AND APPLICATIONS,6(10), 1536 -1543 | en_US |
| dc.subject (關鍵詞) | LISTS;GRAPH theory;PETRI nets;INFORMATION resources;INFORMATION storage & retrieval systems;COMBINATORIAL analysis | en_US |
| dc.title (題名) | Enumeration of Reachable States for Arbitrary Marked Graphs | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1049/iet-cta.2011.0491 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1049/iet-cta.2011.0491 | en_US |
