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

題名 On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systems
作者 趙玉
Chao, Daniel Yuh
貢獻者 資管系
關鍵詞 Iterative methods; Petri nets; Siphons; Supervisory personnel; Computationally efficient; Controlled system; Deadlock prevention; Liveness-enforcing supervisor; Lower bounds; Optimal controls; Reachability graphs; Sequential process; Flexible manufacturing systems
日期 2015-01
上傳時間 9-Aug-2017 17:18:20 (UTC+8)
摘要 Recently, a novel and computationally efficient method-based on a vector covering approach-to design optimal control places and an iteration approach that computes the reachability graph to obtain a maximally permissive liveness enforcing supervisor for FMS (flexible manufacturing systems) have been reported. However, it is unclear as to the relationship between the structure of the net and the minimal number of monitors required. This paper develops a theory to show that the minimal number of monitors required cannot be less than that of basic siphons in α-S3PR (systems of simple sequential processes with resources). This confirms that two of the three controlled systems by Chen et al. are of a minimal monitor configuration since they belong to α-S3PR and their number in each example equals that of basic siphons. © 2013 Taylor and Francis.
關聯 International Journal of Systems Science, 46(2), 332-339
資料類型 article
DOI http://dx.doi.org/10.1080/00207721.2013.783946
dc.contributor 資管系zh_Tw
dc.creator (作者) 趙玉zh_TW
dc.creator (作者) Chao, Daniel Yuhen_US
dc.date (日期) 2015-01en_US
dc.date.accessioned 9-Aug-2017 17:18:20 (UTC+8)-
dc.date.available 9-Aug-2017 17:18:20 (UTC+8)-
dc.date.issued (上傳時間) 9-Aug-2017 17:18:20 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/111686-
dc.description.abstract (摘要) Recently, a novel and computationally efficient method-based on a vector covering approach-to design optimal control places and an iteration approach that computes the reachability graph to obtain a maximally permissive liveness enforcing supervisor for FMS (flexible manufacturing systems) have been reported. However, it is unclear as to the relationship between the structure of the net and the minimal number of monitors required. This paper develops a theory to show that the minimal number of monitors required cannot be less than that of basic siphons in α-S3PR (systems of simple sequential processes with resources). This confirms that two of the three controlled systems by Chen et al. are of a minimal monitor configuration since they belong to α-S3PR and their number in each example equals that of basic siphons. © 2013 Taylor and Francis.en_US
dc.format.extent 212 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) International Journal of Systems Science, 46(2), 332-339en_US
dc.subject (關鍵詞) Iterative methods; Petri nets; Siphons; Supervisory personnel; Computationally efficient; Controlled system; Deadlock prevention; Liveness-enforcing supervisor; Lower bounds; Optimal controls; Reachability graphs; Sequential process; Flexible manufacturing systemsen_US
dc.title (題名) On the lower bound of monitor solutions of maximally permissive supervisors for a subclass α-S3PR of flexible manufacturing systemsen_US
dc.type (資料類型) article
dc.identifier.doi (DOI) 10.1080/00207721.2013.783946
dc.doi.uri (DOI) http://dx.doi.org/10.1080/00207721.2013.783946