期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Behavior Consistency Computation for Workflow Nets With Unknown Correspondence 被引量:2
1
作者 Mimi Wang Guanjun Liu +2 位作者 Peihai Zhao Chungang Yan Changjun Jiang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2018年第1期281-291,共11页
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... 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)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部