Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/78969


Title: Reachability of synchronized choice Petri nets
Authors: Chao, Daniel Yuh
趙玉
Contributors: 資管系
Date: 2002
Issue Date: 2015-10-15 16:07:13 (UTC+8)
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.
Relation: IEEE International Conference on Systems, Man, and Cybernetics - SMC , vol. 6
Data Type: conference
DOI 連結: http://dx.doi.org/10.1109/ICSMC.2002.1175584
Appears in Collections:[資訊管理學系] 會議論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML647View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing