Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches

doi:10.1109/JAS.2021.1004326

CASIA OpenIR > 学术期刊 > IEEE/CAA Journal of Automatica Sinica

	Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches
	Dan You; Oussama Karoui; Shouguang Wang
发表期刊	IEEE/CAA Journal of Automatica Sinica
ISSN	2329-9266
	2022
卷号	9 期号:2 页码:329-338
摘要	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.
关键词	Petri nets (PNs) problem decomposition resource-allocation systems siphons
DOI	10.1109/JAS.2021.1004326
引用统计	被引频次：5[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	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.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
JAS-2021-0358.pdf（1372KB）	期刊论文	出版稿	开放获取	CC BY-NC-SA	浏览