Graph theory and model collection management: conceptual framework and runtime analysis of selected graph algorithms

Analysing conceptual models is a frequent task of business process management (BPM), for instance to support comparison or integration of business processes, to check business processes for compliance or weaknesses, or to tailor conceptual models for different audiences. As recently, many companies...

Full description

Saved in:
Bibliographic Details
Published inInformation systems and e-business management Vol. 13; no. 1; pp. 69 - 106
Main Authors Breuker, Dominic, Delfmann, Patrick, Dietrich, Hanns-Alexander, Steinhorst, Matthias
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1617-9846
1617-9854
DOI10.1007/s10257-014-0243-6

Cover

More Information
Summary:Analysing conceptual models is a frequent task of business process management (BPM), for instance to support comparison or integration of business processes, to check business processes for compliance or weaknesses, or to tailor conceptual models for different audiences. As recently, many companies have started to maintain large model collections and analysing such collections manually may be laborious, practitioners have articulated a demand for automatic model analysis support. Hence, BPM scholars have proposed a plethora of different model analysis techniques. As virtually any conceptual model can be interpreted as a mathematical graph and model analysis techniques often include some kind of graph problem, in this paper, we introduce a graph algorithm based model analysis framework that can be accessed by specialized model analysis techniques. To prove that basic graph algorithms are feasible to support such a framework, we conduct a performance analysis of selected graph algorithms.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1617-9846
1617-9854
DOI:10.1007/s10257-014-0243-6