| dc.contributor | 資管系 | en_US |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | en_US |
| dc.date (日期) | 2014 | en_US |
| dc.date.accessioned | 30-Jun-2014 18:23:56 (UTC+8) | - |
| dc.date.available | 30-Jun-2014 18:23:56 (UTC+8) | - |
| dc.date.issued (上傳時間) | 30-Jun-2014 18:23:56 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/67040 | - |
| dc.description.abstract (摘要) | This paper aims to compute the number of reachable (forbidden, live and deadlock) states for flexible manufacturing systems (FMS) without the construction of reachability graph. The problem is nontrivial and takes, in general, an exponential amount of time to solve. Hence, this paper focusses on a simple version of Systems of Simple Sequential Processes with Resources (S3PR), called kth-order system, where each resource place holds one token to be shared between two processes. The exact number of reachable (forbidden, live and deadlock) states can be computed recursively. | en_US |
| dc.format.extent | 128 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | International Journal of Systems Science, 45(3), 702-710 | en_US |
| dc.subject (關鍵詞) | reachability; S3PR; flexible manufacturing systems; Petri nets | en_US |
| dc.title (題名) | Recursive solution of number of reachable states of a simple subclass of FMS | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1080/00207721.2012.745240 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1080/00207721.2012.745240 | en_US |
