1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems
作者 Wu, W.H.;Chao, D.Y.
趙玉
貢獻者 資管系
關鍵詞 Petri net ; flexible manufacturing system (FMS) ; deadlock prevention
日期 2015
上傳時間 10-Dec-2015 16:16:42 (UTC+8)
摘要 Traditional region-based liveness-enforcing supervisors focus on (1) maximal permissiveness of not losing legal states, (2) structural simplicity of minimal number of monitors, and (3) fast computation. Lately, a number of similar approaches can achieve minimal configuration using efficient linear programming. However, it is unclear as to the relationship between the minimal configuration and the net structure. It is important to explore the structures involved for the fewest monitors required. Once the lower bound is achieved, further iteration to merge (or reduce the number of) monitors is not necessary. The minimal strongly connected resource subnet (i.e., all places are resources) that contains the set of resource places in a basic siphon is an elementary circuit. Earlier, we showed that the number of monitors required for liveness-enforcing and maximal permissiveness equals that of basic siphons for a subclass of Petri nets modelling manufacturing, called α systems. This paper extends this to systems more powerful than the α one so that the number of monitors in a minimal configuration remains to be lower bounded by that of basic siphons. This paper develops the theory behind and shows examples.
關聯 International Journal of Systems Science
資料類型 article
DOI http://dx.doi.org/10.1080/00207721.2014.977977
dc.contributor 資管系
dc.creator (作者) Wu, W.H.;Chao, D.Y.
dc.creator (作者) 趙玉zh_TW
dc.date (日期) 2015
dc.date.accessioned 10-Dec-2015 16:16:42 (UTC+8)-
dc.date.available 10-Dec-2015 16:16:42 (UTC+8)-
dc.date.issued (上傳時間) 10-Dec-2015 16:16:42 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/79632-
dc.description.abstract (摘要) Traditional region-based liveness-enforcing supervisors focus on (1) maximal permissiveness of not losing legal states, (2) structural simplicity of minimal number of monitors, and (3) fast computation. Lately, a number of similar approaches can achieve minimal configuration using efficient linear programming. However, it is unclear as to the relationship between the minimal configuration and the net structure. It is important to explore the structures involved for the fewest monitors required. Once the lower bound is achieved, further iteration to merge (or reduce the number of) monitors is not necessary. The minimal strongly connected resource subnet (i.e., all places are resources) that contains the set of resource places in a basic siphon is an elementary circuit. Earlier, we showed that the number of monitors required for liveness-enforcing and maximal permissiveness equals that of basic siphons for a subclass of Petri nets modelling manufacturing, called α systems. This paper extends this to systems more powerful than the α one so that the number of monitors in a minimal configuration remains to be lower bounded by that of basic siphons. This paper develops the theory behind and shows examples.
dc.format.extent 110 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) International Journal of Systems Science
dc.subject (關鍵詞) Petri net ; flexible manufacturing system (FMS) ; deadlock prevention
dc.title (題名) Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems
dc.type (資料類型) article
dc.identifier.doi (DOI) 10.1080/00207721.2014.977977
dc.doi.uri (DOI) http://dx.doi.org/10.1080/00207721.2014.977977