| dc.contributor | 資管系 | |
| dc.creator (作者) | Chao, Daniel Yuh | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.date (日期) | 2006 | |
| dc.date.accessioned | 21-Jul-2015 15:05:55 (UTC+8) | - |
| dc.date.available | 21-Jul-2015 15:05:55 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-Jul-2015 15:05:55 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/76742 | - |
| dc.description.abstract (摘要) | The behavior of a Petri net (PN) depends not only on the graphical structure, but also on the initial marking of the net. The knitting technique solves the structural problem. It contains some simple yet effective rules which can guide the synthesis of PN with desired properties. The previous knitting technique admits only TT generations among sequential or concurrent processes and PP generations among sequential or exclusive processes. The synthesized nets, however, are restricted because some generations are prohibited. Recently, we have improved the synthesis rules such that the previously forbidden generations are admissible if they are accompanied with additional generations. This paper deals with how to remove the restrictions of TP-path or PT-path generations. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Journal of Information Science and Engineering, Volume 224, Pages 909-923 | |
| dc.subject (關鍵詞) | Concurrent engineering; Graphic methods; Information technology; Problem solving; Automated manufacturing systems; Boundedness; Concurrent systems; Cycles; Deadlock; Liveness; Reversible; Rules; Structural relationship; Petri nets | |
| dc.title (題名) | Knitting technique with TP-PT generations for petri net synthesis | |
| dc.type (資料類型) | conference | en |
