# Alignment Approximation for Process Trees

arXiv: https://arxiv.org/abs/2009.14094 · HTML: https://mlsanity.com/paper/2009.14094/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Sep 2020.

## Built on by (most cited first, 2 of 2)

- [An Invertible State Space for Process Trees](https://mlsanity.com/paper/2407.21468/) (2024)
- [Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*](https://mlsanity.com/paper/2605.26938/) (2026)

## Abstract (arXiv)

Comparing observed behavior (event data generated during process executions) with modeled behavior (process models), is an essential step in process mining analyses. Alignments are the de-facto standard technique for calculating conformance checking statistics. However, the calculation of alignments is computationally complex since a shortest path problem must be solved on a state space which grows non-linearly with the size of the model and the observed behavior, leading to the well-known state space explosion problem. In this paper, we present a novel framework to approximate alignments on process trees by exploiting their hierarchical structure. Process trees are an important process model formalism used by state-of-the-art process mining techniques such as the inductive mining approaches. Our approach exploits structural properties of a given process tree and splits the alignment computation problem into smaller sub-problems. Finally, sub-results are composed to obtain an alignment. Our experiments show that our approach provides a good balance between accuracy and computation time.