基于变迁标签图编辑距离的过程模型相似性度量.pdfVIP

计算机集成制造系统 Vo l. 22 No. 2 第 22 卷第 2 期 2 0 1 6 年 2 月 Computer Integrated Manufacturing Systems Feb. 201 6 DOI :lO. 13196/j. cims. 2016.02.007 基于变迁标签图编辑距离的过程模型相似性度量 王子璇，闻立杰十，汪抒浩，王建民 (清华大学软件学院，北京 100084) 摘 要:针对现有过程模型行为相似性度量算法计算结果不够精准或者计算效率较低等问题，提出一种基于 可覆盖图编辑距离的行为相似性度量算法(TAGERL TAGER 算法通过定义变迁标签图来表达过程模型的行为， 定义了考虑模型行为的图编辑操作以及编辑距离的计算方法，设计了 A 算法计算变迁标签图节点间匹配的最优 方案。通过三角不等式满足率和平均计算挺时对 TAGER 算法的表现进行了评估，并从计算效率及性质满足情况 等方面与其他主流算法进行了对比。 关键词:Petri 网;相似性度量;可覆盖图;编辑距离;A 匹配算法 中图分类号:TP301 文献标识码:A Similarity measurement for process models based on transition-Iabeled graph edit distance WANG Zixuan , WEN Lijie+ , WANG Shuhao , WANG }ianmin (School of Software , Tsinghua University , Beijing 100084 , China) Abstract: Aiming at the problem that the calculating result of behavioral similarity measures was inaccurate and inef- ficiency in existing process models , an approach named Transition-labeled Graph Edit Distance(TAGER) to com pute the similarity based on edit distance between coverability graphs was proposed. Through defining the transi- tion-labeled graph , the behaviors of process models was expressed. The computing method of graph edit operations and graph edit distance according to behavioral features was refined. The matching optimal scheme between nodes of two T-Iabeled graphs was calculated with A algorithm. Through the satisfied rate and average time cost of triangle inequality , TAGER from efficiency and efficacy perspectives was evaluated , and an experimental comparison be tween T AGER and other mainstream similarity algorithms was completed. Keywords: Petri n