Computation of Secure Consistency for Real Systems

Mimi Wang, GuanJun Liu, Changjun Jiang, ChunGang Yan

Abstract: In real applications, many systems have the different security, but their securities are considered to be consistent. In other words, two workflow net systems with different security policies, are thought to be completely similar (i.e., their similarity degree is 1) by the formula proposed by Mendling et al. However, we find that their definition is not accurate. The reason is that the related definition does not accurately feature the relations of transitions. Therefore, this paper refines the relations of transitions based on event relations in the branching processes. And then to distinguish these two systems, we define the security consistency and security consistency degree, and propose a new formula to compute the security similarity degree of two nets. Additionally, this paper utilizes some examples to show these definitions, computation as well as the advantages.