1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Enumeration of reachable, forbidden, live states of gen-left k-net system (with a non-sharing resource place) of Petri Nets
作者 趙玉
Chao, Daniel Yuh
Yu, Tsung Hsien
貢獻者 資管系
關鍵詞 Artificial intelligence; Artificial intelligence; Computation theory; Control systems; Flexible manufacturing systems; Graph theory; Manufacture; Petri nets; Closed form solutions; Closed form solutions; Large-scale optimization; Large-scale optimization; Marked graphs; Marked graphs; Net systems; Net systems; Order systems; Order systems; Sequential process; Sequential process; Sharing resources; Sharing resources; Side process; Side process; Discrete event simulation
日期 2015-01
上傳時間 9-Aug-2017 17:28:16 (UTC+8)
摘要 Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and kth order system which is the simplest class of S3PR (Systems of Simple Sequential Processes with Resources). This paper progresses one step further on enumerating reachable (forbidden, live, and deadlock) states for general k-net systems (one non-sharing resource place in the general position of the Left-side process) with a formula depending on parameter k for a subclass of nets with k sharing resources. The results are also verified by Top-Left-k-net, Bottom-Left-k-net and Middle-Left-k-net system. © 2014 IEEE.
關聯 IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CICA 2014: 2014 IEEE Symposium on Computational Intelligence in Control and Automation, Proceedings,
資料類型 conference
DOI http://dx.doi.org/10.1109/CICA.2014.7013244
dc.contributor 資管系zh_Tw
dc.creator (作者) 趙玉zh_TW
dc.creator (作者) Chao, Daniel Yuhen_US
dc.creator (作者) Yu, Tsung Hsienen_US
dc.date (日期) 2015-01en_US
dc.date.accessioned 9-Aug-2017 17:28:16 (UTC+8)-
dc.date.available 9-Aug-2017 17:28:16 (UTC+8)-
dc.date.issued (上傳時間) 9-Aug-2017 17:28:16 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/111693-
dc.description.abstract (摘要) Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and kth order system which is the simplest class of S3PR (Systems of Simple Sequential Processes with Resources). This paper progresses one step further on enumerating reachable (forbidden, live, and deadlock) states for general k-net systems (one non-sharing resource place in the general position of the Left-side process) with a formula depending on parameter k for a subclass of nets with k sharing resources. The results are also verified by Top-Left-k-net, Bottom-Left-k-net and Middle-Left-k-net system. © 2014 IEEE.en_US
dc.format.extent 209 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CICA 2014: 2014 IEEE Symposium on Computational Intelligence in Control and Automation, Proceedings,en_US
dc.subject (關鍵詞) Artificial intelligence; Artificial intelligence; Computation theory; Control systems; Flexible manufacturing systems; Graph theory; Manufacture; Petri nets; Closed form solutions; Closed form solutions; Large-scale optimization; Large-scale optimization; Marked graphs; Marked graphs; Net systems; Net systems; Order systems; Order systems; Sequential process; Sequential process; Sharing resources; Sharing resources; Side process; Side process; Discrete event simulationen_US
dc.title (題名) Enumeration of reachable, forbidden, live states of gen-left k-net system (with a non-sharing resource place) of Petri Netsen_US
dc.type (資料類型) conference
dc.identifier.doi (DOI) 10.1109/CICA.2014.7013244
dc.doi.uri (DOI) http://dx.doi.org/10.1109/CICA.2014.7013244