Improving merging conditions for recomposing conformance checking

Lee, W. L. J., Munoz-Gama, J., Verbeek, H. M. W., van der Aalst, W. M. P., & Sepúlveda, M. (2019). Improving merging conditions for recomposing conformance checking. In F. Daniel, Q. Z. Sheng, & H. Motahari (Eds.), Business Process Management Workshops – BPM 2018 International Workshops, Revised Papers (pp. 31-43). (Lecture Notes in Business Information Processing; Vol. 342). Cham: Springer. DOI: 10.1007/978-3-030-11641-5_3


Efficient conformance checking is a hot topic in the field of process mining. Much of the recent work focused on improving the scalability of alignment-based approaches to support the larger and more complex processes. This is needed because process mining is increasingly applied in areas where models and logs are “big”. Decomposition techniques are able to achieve significant performance gains by breaking down a conformance problem into smaller ones. Moreover, recent work showed that the alignment problem can be resolved in an iterative manner by alternating between aligning a set of decomposed sub-components before merging the computed sub-alignments and recomposing sub-components to fix merging issues. Despite experimental results showing the gain of applying recomposition in large scenarios, there is still a need for improving the merging step, where log traces can take numerous recomposition steps before reaching the required merging condition. This paper contributes by defining and structuring the recomposition step, and proposes strategies with significant performance improvement on synthetic and real-life datasets over both the state-of-the-art decomposed and monolithic approaches.

Leave a Reply