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

題名 Enumeration of reachable (forbidden, live and deadlock) states of kth order system of Petri nets
作者 Chao, Daniel Yuh
趙玉
貢獻者 資訊管理學系
關鍵詞 Acoustic wave reflection; Control systems; Flexible manufacturing systems; Manufacture; Petri nets; Closed form solutions; Closed-form formulae; Infinite system; Marked graphs; Order systems; Process steps; Recursions; Resource allocation systems; Discrete event simulation
日期 2015-12
上傳時間 7-Aug-2017 17:44:23 (UTC+8)
摘要 So far, none (except the authors) in the literature proposes closed-form solutions of the number of reachable states for even the marked graphs, the simplest subclass of Petri nets, not to mention infinite systems (i.e. very large number of resources and process steps). This paper is the first one to tackle such issues by estimating reachable (forbidden, live and deadlock) states with a non-recursion and closed-form formula (depending on parameter k) for a subclass of nets with k resources. As a result, we can deal with even an infinite system with infinite resources which nobody can ever do it. Extension to more than two processes has been briefly presented. Application to large Gadara RAS (resource allocation system) is also mentioned. ©The authors 2014. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.
關聯 IMA Journal of Mathematical Control and Information, 32(4), 823-837
資料類型 article
DOI http://dx.doi.org/10.1093/imamci/dnu025
dc.contributor 資訊管理學系zh_Tw
dc.creator (作者) Chao, Daniel Yuhen_US
dc.creator (作者) 趙玉zh_TW
dc.date (日期) 2015-12en_US
dc.date.accessioned 7-Aug-2017 17:44:23 (UTC+8)-
dc.date.available 7-Aug-2017 17:44:23 (UTC+8)-
dc.date.issued (上傳時間) 7-Aug-2017 17:44:23 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/111655-
dc.description.abstract (摘要) So far, none (except the authors) in the literature proposes closed-form solutions of the number of reachable states for even the marked graphs, the simplest subclass of Petri nets, not to mention infinite systems (i.e. very large number of resources and process steps). This paper is the first one to tackle such issues by estimating reachable (forbidden, live and deadlock) states with a non-recursion and closed-form formula (depending on parameter k) for a subclass of nets with k resources. As a result, we can deal with even an infinite system with infinite resources which nobody can ever do it. Extension to more than two processes has been briefly presented. Application to large Gadara RAS (resource allocation system) is also mentioned. ©The authors 2014. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.en_US
dc.format.extent 207 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) IMA Journal of Mathematical Control and Information, 32(4), 823-837en_US
dc.subject (關鍵詞) Acoustic wave reflection; Control systems; Flexible manufacturing systems; Manufacture; Petri nets; Closed form solutions; Closed-form formulae; Infinite system; Marked graphs; Order systems; Process steps; Recursions; Resource allocation systems; Discrete event simulationen_US
dc.title (題名) Enumeration of reachable (forbidden, live and deadlock) states of kth order system of Petri netsen_US
dc.type (資料類型) article
dc.identifier.doi (DOI) 10.1093/imamci/dnu025
dc.doi.uri (DOI) http://dx.doi.org/10.1093/imamci/dnu025