Workload defines the benchmark to a great extent. It needs to be realistic and well designed in order to address the system’s main features. In the case of benchmarking Workflow Management Systems the workload needs to address numerous different system features.

Therefore, we study the automated process synthesis in order to address different user-defined characteristics and make the workload sets useful for different use-cases. With respect to this goal we need to study large process models collections for similarities. Currently, there are three main research streams on process models similarities: text similarities, behavioral similarities and structural similarities. As behavioral data and text semantics are usually missing from mock-up or obfuscated models we focus on the detection of structural similarities.

This information gives us a macroscopic overview of the existing collection. The problem of the automated detection of re-occurring structures in a collection of process models, when text semantics or behavioral data are missing is a case of (sub)graph isomorphism, which is mentioned as NP-complete in the literature. In this seminar we will focus on the methodology followed for the detection of re-occurring structures in a collection of process models. We will also demonstrate the first results from the method’s application.