Behavior Consistency Computation for Workflow Nets With Unknown Correspondence  

作　　者：Mimi Wang Guanjun Liu Peihai Zhao Chungang Yan Changjun Jiang 

机构地区：[1]Department of Computer Science and Technology, the Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai 200092, China [2]IEEE

出　　处：《IEEE/CAA Journal of Automatica Sinica》2018年第1期281-291,共11页自动化学报（英文版）

基　　金：supported in part by the National Key R&D Program of China(2017YFB1001804);Shanghai Science and Technology Innovation Action Plan Project(16511100900);the National Natural Science Foundation of China(61572360)

摘　　要：Consistency degree calculation is established on the basis of known correspondence, but in real life, the correspondence is generally unknown, so how to calculate consistency of two models under unknown correspondence has become a problem. For this condition, we should analyze unknown correspondence due to the influence of different correspondences.In this paper we obtain the relations of transitions based on event relations using branching processes, and build a behavioral matrix of relations. Based on the permutation of behavioral matrix, we express different correspondences, and define a new formula to compute the maximal consistency degree of two workflow nets. Additionally, this paper utilizes an example to show these definitions, computation as well as the advantages.Consistency degree calculation is established on the basis of known correspondence, but in real life, the correspondence is generally unknown, so how to calculate consistency of two models under unknown correspondence has become a problem. For this condition, we should analyze unknown correspondence due to the influence of different correspondences.In this paper we obtain the relations of transitions based on event relations using branching processes, and build a behavioral matrix of relations. Based on the permutation of behavioral matrix, we express different correspondences, and define a new formula to compute the maximal consistency degree of two workflow nets. Additionally, this paper utilizes an example to show these definitions, computation as well as the advantages.

关 键 词：Behavioral matrix branching process consistency degree unknown correspondence workflow net(WF-nets) 

分 类 号：TP[自动化与计算机技术]