It is common for large enterprises or organizations to maintain repositories of process models. This paper focuses on how to measure the similarity and construct matching relations more effectively between process models. To resolve exponential time complexity to match node compositions, we proposed a graph-edit distance similarity metric based on SESE process fragments, and a greedy algorithm ...

So far, a handful contributions have been made to the problem of process model matching. The Triple-S matching approach adheres to the KISS principle by avoiding complexity and keeping it simple and stupid. It combines similarity scores of independent levels as basis for a well-founded decision about matching transition pairs of different process models. The following three levels and scores ar...

Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payo¤s and transitions functions of sequential decision models that insure that the models are robust to the non-uniqueness of the matching process. Unde...