Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/67040
題名: | Recursive solution of number of reachable states of a simple subclass of FMS | 作者: | 趙玉 Chao, Daniel Yuh |
貢獻者: | 資管系 | 關鍵詞: | reachability; S3PR; flexible manufacturing systems; Petri nets | 日期: | 2014 | 上傳時間: | 30-Jun-2014 | 摘要: | 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. | 關聯: | International Journal of Systems Science, 45(3), 702-710 | 資料類型: | article | DOI: | http://dx.doi.org/10.1080/00207721.2012.745240 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 128 B | HTML2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.