Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches
文献类型：期刊论文
| 作者 | Dan You; Oussama Karoui; Shouguang Wang |
| 刊名 | IEEE/CAA Journal of Automatica Sinica
 |
| 出版日期 | 2022 |
| 卷号 | 9期号:2页码:329-338 |
| 关键词 | Petri nets (PNs) problem decomposition resource-allocation systems siphons |
| ISSN号 | 2329-9266 |
| DOI | 10.1109/JAS.2021.1004326 |
| 英文摘要 | A large amount of research has shown the vitality of siphon enumeration in the analysis and control of deadlocks in various resource-allocation systems modeled by Petri nets (PNs). In this paper, we propose an algorithm for the enumeration of minimal siphons in PN based on problem decomposition. The proposed algorithm is an improved version of the global partitioning minimal-siphon enumeration (GPMSE) proposed by Cordone et al. (2005) in IEEE Transactions on Systems, Man, and Cybernetics—Part A: Systems and Humans, which is widely used in the literature to compute minimal siphons. The experimental results show that the proposed algorithm consumes lower computational time and memory compared with GPMSE, which becomes more evident when the size of the handled net grows. |
| 源URL | [http://ir.ia.ac.cn/handle/173211/45993]  |
| 专题 | 自动化研究所_学术期刊_IEEE/CAA Journal of Automatica Sinica |
| 推荐引用方式 GB/T 7714 | Dan You,Oussama Karoui,Shouguang Wang. Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches[J]. IEEE/CAA Journal of Automatica Sinica,2022,9(2):329-338. |
| APA | Dan You,Oussama Karoui,&Shouguang Wang.(2022).Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches.IEEE/CAA Journal of Automatica Sinica,9(2),329-338. |
| MLA | Dan You,et al."Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches".IEEE/CAA Journal of Automatica Sinica 9.2(2022):329-338. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。