Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/110593
題名: | Proof by model: a new knowledge-based reachability analysis methodology for Petri net | 作者: | 趙玉;季延平;游宗憲;游禮志;李耀中 | 貢獻者: | 資管博五 | 關鍵詞: | control systems, discrete event systems, flexible manufacturing systems, petri nets | 日期: | Jul-2016 | 上傳時間: | 29-Jun-2017 | 摘要: | To solve the state explosion problem in the reachability analysis of Petri nets, Chao recently broke the NP(nondeterministic polynomial time)-complete barrier by developing the first closed-form solution of the number of Control Related States for the kk th-order system. In this paper, we propose a new proof methodology known as proof by model, which is based on the validated information of the reverse net, to simplify and accelerate the construction of the closed-form solution for Petri nets. Here, we apply this methodology to the proof procedure of Top-Right systems with one non-sharing resource placed in the top position of the right-side process. The core theoretical and data basis are that any forbidden (resp. live) state in a Petri net is non-reachable (resp. live) in its reverse net; and the validated information of the Bottom-Right system, the reverse net of Top-Right. | 關聯: | IMA Journal of Mathematical Control and Information, 32, 1-22 | 資料類型: | article | DOI: | http://dx.doi.org/10.1093/imamci/dnw025 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1-22(5).pdf | 777.85 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.