Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Reachability of synchronized choice Petri nets
作者 Chao, Daniel Yuh
趙玉
貢獻者 資管系
日期 2002
上傳時間 15-Oct-2015 16:07:13 (UTC+8)
摘要 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.
關聯 IEEE International Conference on Systems, Man, and Cybernetics - SMC , vol. 6
資料類型 conference
DOI http://dx.doi.org/10.1109/ICSMC.2002.1175584
dc.contributor 資管系
dc.creator (作者) Chao, Daniel Yuh
dc.creator (作者) 趙玉zh_TW
dc.date (日期) 2002
dc.date.accessioned 15-Oct-2015 16:07:13 (UTC+8)-
dc.date.available 15-Oct-2015 16:07:13 (UTC+8)-
dc.date.issued (上傳時間) 15-Oct-2015 16:07:13 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/78969-
dc.description.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.
dc.format.extent 130 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) IEEE International Conference on Systems, Man, and Cybernetics - SMC , vol. 6
dc.title (題名) Reachability of synchronized choice Petri nets
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1109/ICSMC.2002.1175584
dc.doi.uri (DOI) http://dx.doi.org/10.1109/ICSMC.2002.1175584