| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao,Daniel Yuh | - |
| dc.date (日期) | 2005-01 | en_US |
| dc.date.accessioned | 17-Jan-2009 16:05:17 (UTC+8) | - |
| dc.date.available | 17-Jan-2009 16:05:17 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Jan-2009 16:05:17 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/27045 | - |
| dc.description.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. | - |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Journal of Information Science and Engineering, 21(1), 129-152 | en_US |
| dc.title (題名) | Reachability and Firing Sequences of Homogeneous Synchronized Choice Petri Nets | en_US |
| dc.type (資料類型) | article | en |
