Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches

作     者：Dan You Oussama Karoui Shouguang Wang Dan You;Oussama Karoui;Shouguang Wang

作者机构：IEEE School of Information and Electronic Engineering(Sussex Artificial Intelligence Institute)Zhejiang Gongshang UniversityHangzhou 310018China 

出 版 物：《IEEE/CAA Journal of Automatica Sinica》 (自动化学报（英文版）)

年 卷 期：2022年第9卷第2期

页      面：329-338页

核心收录：

学科分类：08[工学] 0701[理学-数学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the Zhejiang Natural Science Foundation(LQ20F020009) the Zhejiang Provincial Key Laboratory of New Network Standards and Technologies(2013E10012) the Public Technology Research Plan of Zhejiang Province(LGJ21F030001) 

主　　题：Index Terms-Petri nets(PNs) problem decomposition resource-allocation systems siphons 

摘      要：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 *** 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 *** 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.