典型文献
Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches
文献摘要：
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.
文献关键词：
中图分类号：
作者姓名：
Dan You;Oussama Karoui;Shouguang Wang
作者机构：
School of Information and Electronic Engineering(Sussex Artificial Intelligence Institute),Zhejiang Gongshang University,Hangzhou 310018,China
文献出处：
引用格式：
[1]Dan You;Oussama Karoui;Shouguang Wang-.Computation of Minimal Siphons in Petri Nets Using Problem Partitioning Approaches)[J].自动化学报（英文版）,2022(02):329-338
A类：
Siphons,siphon,deadlocks,GPMSE,Cordone
B类：
Computation,Minimal,Petri,Nets,Using,Problem,Partitioning,Approaches,large,amount,research,has,shown,vitality,enumeration,analysis,control,various,resource,allocation,systems,modeled,by,nets,PNs,In,this,paper,algorithm,minimal,siphons,problem,decomposition,proposed,improved,version,global,partitioning,IEEE,Transactions,Systems,Man,Cybernetics,Humans,which,widely,used,literature,compute,experimental,results,that,consumes,lower,computational,memory,compared,becomes,more,evident,when,size,handled,grows
AB值：
0.56
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
