dc.coverage.temporal | 計畫年度:89 起迄日期:20000801~20010731 | en_US |
dc.creator (作者) | 趙玉 | zh_TW |
dc.date (日期) | 2000 | en_US |
dc.date.accessioned | 18-Apr-2007 16:40:16 (UTC+8) | en_US |
dc.date.accessioned | 8-Sep-2008 16:36:52 (UTC+8) | - |
dc.date.available | 18-Apr-2007 16:40:16 (UTC+8) | en_US |
dc.date.available | 8-Sep-2008 16:36:52 (UTC+8) | - |
dc.date.issued (上傳時間) | 18-Apr-2007 16:40:16 (UTC+8) | en_US |
dc.identifier (Other Identifiers) | 892213E004012.pdf | en_US |
dc.identifier.uri (URI) | http://tair.lib.ntu.edu.tw:8000/123456789/3989 | en_US |
dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/3989 | - |
dc.description (描述) | 核定金額:278700元 | en_US |
dc.description.abstract (摘要) | SNC 是簡單的且其活動性條件是簡單的。吾人發展一有效率的技術去找出壞的siphons 用於資源共享FMS 之死結預防。由此而產生強於現有的模型。 | - |
dc.description.abstract (摘要) | Any SNC is bounded and its liveness conditions are simple. We develop a new systematic technique to find bad siphons (i.e., not traps) and extend the SNC model to FMS (Flexible Manufacturing System) with resource sharing. The resulting nets are more powerful than existing models in the literature. | - |
dc.format | applicaiton/pdf | en_US |
dc.format.extent | bytes | en_US |
dc.format.extent | 33940 bytes | en_US |
dc.format.extent | 33940 bytes | - |
dc.format.extent | 9451 bytes | - |
dc.format.mimetype | application/pdf | en_US |
dc.format.mimetype | application/pdf | en_US |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | zh-TW | en_US |
dc.language.iso | zh-TW | en_US |
dc.publisher (Publisher) | 臺北市:國立政治大學資訊管理學系 | en_US |
dc.rights (Rights) | 行政院國家科學委員會 | en_US |
dc.subject (關鍵詞) | 派翠網路;彈性製造系統;同步選擇網路;死結 | - |
dc.subject (關鍵詞) | Petri nets;Flexible manufacturing system;Synchronized choice net;Deadlock | - |
dc.title (題名) | 使用漸進式法去尋找最小希馮及死結分析派翠網路模擬之彈性製造系統 | zh_TW |
dc.title.alternative (其他題名) | An Incremental Approach to Searching Minimal Siphons and Deadlock Analysis of Flexible Manufacturing Systems Using Petri Nets | - |
dc.type (資料類型) | report | en |