Behavior Consistency Computation for Workflow Nets With Unknown Correspondence

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

作者机构：Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China IEEE 

出 版 物：《IEEE/CAA Journal of Automatica Sinica》 (自动化学报（英文版）)

年 卷 期：2018年第5卷第1期

页      面：281-291页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

基　　金：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) 

主　　题：Behavioral matrix branching process consistency degree unknown correspondence workflow net(WF-nets) 

摘      要：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 *** 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.