无冲突Petri网系统活标识判定的结构化方法  

Structural method for live marking determination of conflict-free Petri net system

作　　者：徐颖蕾[1] Xu Yinglei(School of Computer Science&Technology,Shandong University of Finance&Economics,Jinan 250014,China)

机构地区：[1]山东财经大学计算机科学与技术学院,济南250014

出　　处：《计算机应用研究》2023年第5期1447-1451,1458,共6页Application Research of Computers

基　　金：山东省自然科学基金资助项目(ZR2020MF137)。

摘　　要：为了有效求解无冲突Petri网系统活标识的判定及配置优化问题,提出无冲突Petri网系统活标识判定的一种结构化方法。该方法首先求取无冲突Petri网的各强连通分支;然后对每一含有元素个数大于2的强连通分支求取其无同步变迁库所索引集合;最终得到无冲突Petri网系统的无前置库所索引集合,基于该库所元素集合即可实现对活标识的快速判定及配置优化。通过例子具体说明了该方法的实现及应用。分析结果表明,所提方法具有多项式时间复杂度,较易于操作和程序化实现。To effectively solve the problem of live marking determination and configuration optimization for conflict-free Petri net systems,this paper proposed a structural method for live marking determination of conflict-free Petri net system.This method firstly computed strongly connected components of conflict-free Petri net,and then computed non-synchronous transition place index set for each strongly connected component with more than two elements,finally it obtained the place index set without preposition for conflict-free Petri net system and could realize quickly live marking determination and configuration optimization based on this place element set.This paper utilized an example to illustrate implementation and application of this method.Analysis results show that the proposed method has polynomial time complexity and is easier to operate and program.

关 键 词：PETRI网 无冲突 活标识 强连通分支 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]