首页 | 本学科首页   官方微博 | 高级检索  
     

无冲突Petri网系统活标识判定的结构化方法
引用本文:徐颖蕾.无冲突Petri网系统活标识判定的结构化方法[J].计算机应用研究,2023,40(5).
作者姓名:徐颖蕾
作者单位:山东财经大学 计算机科学与技术学院
基金项目:山东省自然科学基金资助项目(ZR2020MF137)
摘    要:为了有效求解无冲突Petri网系统活标识的判定及配置优化问题,提出无冲突Petri网系统活标识判定的一种结构化方法。该方法首先求取无冲突Petri网的各强连通分支;然后对每一含有元素个数大于2的强连通分支求取其无同步变迁库所索引集合;最终得到无冲突Petri网系统的无前置库所索引集合,基于该库所元素集合即可实现对活标识的快速判定及配置优化。通过例子具体说明了该方法的实现及应用。分析结果表明,所提方法具有多项式时间复杂度,较易于操作和程序化实现。

关 键 词:Petri网    无冲突    活标识    强连通分支
收稿时间:2022/9/29 0:00:00
修稿时间:2023/4/17 0:00:00

Structural method for live marking determination of conflict-free Petri net system
Xu Yinglei.Structural method for live marking determination of conflict-free Petri net system[J].Application Research of Computers,2023,40(5).
Authors:Xu Yinglei
Affiliation:School of Computer Science and Technology,Shandong University of Finance and Economics
Abstract: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 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.
Keywords:Petri net  conflict-free  live marking  strongly connected component
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号