學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 A control policy for γ-nets without reachability analysis and siphon enumeration
作者 Wu, W.;Chao, D.Y.;Yu, Fang
郁方
貢獻者 資管系
關鍵詞 Control policy; Deadlock prevention; Optimal controller; Permissive controllers; Reachability analysis; Research topics; Sequential process; Flexible manufacturing systems; Petri nets; Siphons; Controllers
日期 2013
上傳時間 16-Apr-2015 17:36:35 (UTC+8)
摘要 Synthesizing maximally permissive controllers with fewest monitors has been a popular research topic. Current optimal controllers for large flexible manufacturing systems (FMS) require costly time consuming reachability analysis. Our previous work shows that among all n-dependent siphons, only one siphon (whose unmarked state follows specific token distribution) needs to be controlled. This greatly simplifies the synthesis as well as minimizes the number of monitors required while making the controlled net nearly maximally permissive. However, some live states may get lost. To reach more live states, the controller regions must be refined to be less affected or disturbed by the monitors and their controlled arcs. We observe that the markings of all the resulting controller regions follow a simple pattern. Based on this pattern of unmarked siphons, this paper further proposes a maximally permissive control policy for a subclass of S3PR (Systems of Simple Sequential Processes with Resources). © 2013 IEEE.
關聯 IEEE International Conference on Automation Science and Engineering,2013, 論文編號 6653897, Pages 1133-1138, Madison, WI; United States; 17 August 2013 到 20 August 2013; 代碼 101740
10.1109/CoASE.2013.6653897
資料類型 conference
dc.contributor 資管系
dc.creator (作者) Wu, W.;Chao, D.Y.;Yu, Fang
dc.creator (作者) 郁方zh_TW
dc.date (日期) 2013
dc.date.accessioned 16-Apr-2015 17:36:35 (UTC+8)-
dc.date.available 16-Apr-2015 17:36:35 (UTC+8)-
dc.date.issued (上傳時間) 16-Apr-2015 17:36:35 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/74637-
dc.description.abstract (摘要) Synthesizing maximally permissive controllers with fewest monitors has been a popular research topic. Current optimal controllers for large flexible manufacturing systems (FMS) require costly time consuming reachability analysis. Our previous work shows that among all n-dependent siphons, only one siphon (whose unmarked state follows specific token distribution) needs to be controlled. This greatly simplifies the synthesis as well as minimizes the number of monitors required while making the controlled net nearly maximally permissive. However, some live states may get lost. To reach more live states, the controller regions must be refined to be less affected or disturbed by the monitors and their controlled arcs. We observe that the markings of all the resulting controller regions follow a simple pattern. Based on this pattern of unmarked siphons, this paper further proposes a maximally permissive control policy for a subclass of S3PR (Systems of Simple Sequential Processes with Resources). © 2013 IEEE.
dc.format.extent 176 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) IEEE International Conference on Automation Science and Engineering,2013, 論文編號 6653897, Pages 1133-1138, Madison, WI; United States; 17 August 2013 到 20 August 2013; 代碼 101740
dc.relation (關聯) 10.1109/CoASE.2013.6653897
dc.subject (關鍵詞) Control policy; Deadlock prevention; Optimal controller; Permissive controllers; Reachability analysis; Research topics; Sequential process; Flexible manufacturing systems; Petri nets; Siphons; Controllers
dc.title (題名) A control policy for γ-nets without reachability analysis and siphon enumeration
dc.type (資料類型) conferenceen