| dc.contributor | 資管系 | - |
| dc.creator (作者) | Chao, Daniel Yuh ; Yu, Fang | - |
| dc.creator (作者) | 趙玉;郁方 | - |
| dc.date (日期) | 2012 | - |
| dc.date.accessioned | 11-六月-2015 14:25:06 (UTC+8) | - |
| dc.date.available | 11-六月-2015 14:25:06 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-六月-2015 14:25:06 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75695 | - |
| dc.description.abstract (摘要) | This paper reports the very first endeavor toward the computation of the number of reachable states for simple version of Systems of Simple Sequential Processes with Resources (S3PR) without the construction of reachability graph that often makes the analysis intractable. This paper also estimates the number of non-reachable, forbidden, and deadlock states. © 2012 IEEE. | - |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 21st IEEE International Symposium on Industrial Electronics, ISIE 2012; Hangzhou; China; 28 May 2012 through 31 May 2012; Category numberCFP12ISI-21st IEEE International Symposium on Industrial Electronics, ISIE 2012; Hangzhou; China; 28 May 2012 through 31 May 2012; Category numberCFP12ISI-ART; Code 91747 | - |
| dc.subject (關鍵詞) | Deadlock state; Reachability graphs; Sequential process; Control systems; Discrete event simulation; Flexible manufacturing systems; Petri nets; Industrial electronics | - |
| dc.title (題名) | Enumeration of reachable and other states of simple version of Systems of Simple Sequential Processes with Resources (S3PR) | - |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/ISIE.2012.6237290 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ISIE.2012.6237290 | - |
