Article in Proceedings INPROC-2015-26

BibliographySkouradaki, Marigianna; Leymann, Frank: Detecting Frequently Recurring Structures in BPMN 2.0 Process Models.
In: Proceedings of the 9th Symposium and Summer School On Service-Oriented Computing: SummerSOC'14; Heraklion, Greece, June 28 - July 04, 2015.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
pp. 102-116, german.
IBM, July 29, 2015.
Article in Proceedings (Conference Paper).
CR-SchemaI.2.8 (Problem Solving, Control Methods, and Search)
F.2.2 (Nonnumerical Algorithms and Problems)
D.2.9 (Software Engineering Management)
Keywordsstructural similarities; process models; BPMN 2.0; process fragments; subgraph isomorphism

Reusability of process models is frequently discussed in the literature. Practices of reusability are expected to increase the performance of the designers, because they do not need to start everything from scratch, and the usage of best practices is reinforced. However, the detection of reusable parts and best practices in collections of BPMN 2.0 process models is currently only defined through the experience of experts in this field. In this work we extend an algorithm that detects the recurring structures in a collection of process models. The extended algorithm counts the number of times that a recurring structure appears in a collection of process models, and assigns the corresponding number to its semantics. Moreover, the dublicate entries are eliminated from the collection that contains the extracted recurring structures. In this way, we assert that the resulting collection contains only unique entries. We validate our methodology by applying it on a collection of BPMN 2.0 process models and analyze the results. As shown in the analysis the methodology does not only detect applied practices, but also leads to conclusions of our collection’s special characteristics.

Department(s)University of Stuttgart, Institute of Architecture of Application Systems
Project(s)99027410 (BenchFlow)
Entry dateJuly 9, 2015
   Publ. Institute   Publ. Computer Science