计算机应用研究2024，Vol.41Issue(1)：170-176,7.DOI:10.19734/j.issn.1001-3695.2023.05.0193
基于Petri网工作流模型展开树的路径序列相似性算法
Similarity algorithm of path sequence based on Petri net workflow model unfolding tree
许山山 1史涯晴 2简开宇 2魏居尚 2张文焘3
作者信息
- 1. 陆军工程大学指挥控制工程学院,南京 210007||96512部队,青海西宁 810001
- 2. 陆军工程大学指挥控制工程学院,南京 210007
- 3. 辽宁工程技术大学软件学院,辽宁阜新 123032
- 折叠
摘要
Abstract
In the actual data migration project,in order to solve the problem of data mapping,it is necessary to determine the similarity between the two workflow models.This paper analyzed and expounded the similarity of workflow model,and proposed a path sequence similarity algorithm for the unfolding tree of workflow model based on Petri net.Firstly,it used the deep-first search algorithm and dynamic programming algorithm to search the model,and then obtained all path sequences of the unfolding tree by the proposed algorithm.Finally,it used the edit distance algorithm to calculate the pairwise similarity between the two model se-quences,and then completed the model similarity calculation.Compared with other mainstream similarity algorithms,the main ad-vantage is that the partial structure and behavior similarity of the model could be accurately calculated,which could better deter-mine the mapping between processes,so as to find a solution to data mapping.The experimental results show that the proposed method is more reasonable and accurate than the mainstream algorithms based on model structure and behavior similarity.关键词
Petri网/相似性度量/展开树/路径序列Key words
Petri net/similarity measure/unfolding tree/path sequence分类
信息技术与安全科学引用本文复制引用
许山山,史涯晴,简开宇,魏居尚,张文焘..基于Petri网工作流模型展开树的路径序列相似性算法[J].计算机应用研究,2024,41(1):170-176,7.
