Process Similarity Algorithm Based on Weighted Flow Relationship

DUAN Rui; FANG Huan; ZHAN Yue

doi:10.3969/j.issn.0372-2112.2019.12.020

您当前的位置：

首页 >

文章列表页 >

Process Similarity Algorithm Based on Weighted Flow Relationship

更新时间：2025-07-16

- Process Similarity Algorithm Based on Weighted Flow Relationship
- Acta Electronica Sinica Vol. 47, Issue 12, Pages: 2596-2601(2019)
- 作者机构：
  
  安徽理工大学数学与大数据学院,安徽,淮南,232001
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61472003, No.61402011, No.61572035);Natural Science Foundation of Anhui Province (No.1608085QF149);Fund for Distinguished Young Talents in Higher Education of Anhui Province (No.gxyqZD2018038);Postdoctoral Foundation of Anhui Province (No.2018B288)
- DOI：10.3969/j.issn.0372-2112.2019.12.020
  CLC： TP301
- Published Online：25 December 2019，
  
  Published：2019
- 稿件说明：
移动端阅览
DUAN Rui, FANG Huan, ZHAN Yue. Process Similarity Algorithm Based on Weighted Flow Relationship[J]. Acta Electronica Sinica, 2019, 47(12): 2596-2601.
DOI：

DUAN Rui, FANG Huan, ZHAN Yue. Process Similarity Algorithm Based on Weighted Flow Relationship[J]. Acta Electronica Sinica, 2019, 47(12): 2596-2601. DOI： 10.3969/j.issn.0372-2112.2019.12.020.

摘要

为了提高从企业模型库中检索模型的效率，提出一种基于加权流关系的相似性算法，记作WF.首先，本文设计加权流关系集的生成算法，生成算法通过广度优先搜索方法遍历除输出库所外的所有节点及流关系，为每个流关系唯一分配权重，生成加权流关系集；其次，WF算法基于加权流关系集计算出加权变迁集，并依据WF相似性定义计算相似性；最后，通过实验及算法的时间复杂度分析比较表明：算法是正确且唯一确定结果的，且WF算法具有良好的性能.

Abstract

In order to improve the efficiency of retrieving models from enterprise model library

a similarity algorithm based on weighted flow relationship is proposed

regarded as WF. Firstly

this paper designs a weighted flow relationship set generation algorithm. The generation algorithm traverses all nodes and flow relationships except the output place by breadth-first search method. The weight is assigned to each flow relationship to generate a weighted flow relationship set. Secondly

the WF algorithm calculates the weighted transition set based on the weighted flow relationship set

and calculates the similarity according to the WF similarity definition. Finally

through experimental and analyzing the time complexity of the algorithm results show that the proposed algorithm is correct and unique to determine the result and the algorithm has good performance.

关键词

Keywords

references

Views

135

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Modeling and Analysis of Grid Computing Application Based Price Timed Petri Net

Maximal Conflict Set Enumeration Algorithm Based on Locality of Petri Nets

Method for Computing Performance of a Kind of Workflow Models Nested by Basic Model

Reachability Analysis Methods of E-Commerce Business Process Net

Related Author

LIU Wei-dong

SONG Jia-xing

LIN Chuang

PAN Li

ZHENG Hong

LIU Xian-ming

YANG Bo

TIAN Li-qin

Related Institution

Department of Computer Science and Technology, Tsinghua University

School of Information and Communication Engineering, Hunan Institute of Science and Technology

Information Science and Engineering College, East China University of Science and Technology

Information and Communication Branch, Jiangxi Electric Power Company

School of Information and Communication Engineering Hunan Institute of Science and Technology Yueyang Hunan China

⁰