Efficient Transition Adjacency Relation Computation for Process Model Similarity

Abstract

Many activities in business process management, such as process retrieval, process mining and process integration, need to determine the similarity between business processes. Along with many other relational behavior semantics, Transition Adjacency Relation (abbr. TAR) has been proposed as a kind of behavioral gene of process models and a useful perspective for process similarity measurement. In this article we explain why it is still relevant and necessary to improve TAR or pTAR (i.e., projected TAR) computation efficiency and put forward a novel approach for TAR computation based on Petri net unfolding. This approach not only improves the efficiency of TAR computation, but also enables the long-expected combined usage of TAR and Behavior Profiles (abbr. BP) in process model similarity estimation.

Depth-First Net Unfoldings and Equivalent Reduction

“…For instance, initial states a, b, c, and d are represented in black, while newly generated states c, d, i, and k are depicted in green. Reduction of a net utilizing equivalence [31][32][33] is explored.…”