Pattern detection serves different purposes in managing large collections of process models, ranging from syntax checking to compliance validation. This paper presents a runtime analysis of four graph-theoretical algorithms for (frequent) pattern detection. We apply these algorithms to large collections of process and data models to demonstrate that, despite their theoretical intractability, they are able to return results within (milli-) seconds. We discuss the relative performance of these algorithms and their applicability in practice. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Becker, J., Breuker, D., Delfmann, P., Dietrich, H. A., & Steinhorst, M. (2013). A runtime analysis of graph-theoretical algorithms to detect patterns in process model collections. In Lecture Notes in Business Information Processing (Vol. 132 LNBIP, pp. 489–500). Springer Verlag. https://doi.org/10.1007/978-3-642-36285-9_50
Mendeley helps you to discover research relevant for your work.