# An Invertible State Space for Process Trees

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 16 references that are in the map.
- First posted on arXiv 31 Jul 2024.

## Builds on (most cited first, 3 of 3)

- [Mining Local Process Models](https://mlsanity.com/paper/1606.06066/) (2016)
- [Translating Workflow Nets to Process Trees: An Algorithmic Approach](https://mlsanity.com/paper/2004.08213/) (2020)
- [Alignment Approximation for Process Trees](https://mlsanity.com/paper/2009.14094/) (2020)

## Abstract (arXiv)

Process models are, like event data, first-class citizens in most process mining approaches. Several process modeling formalisms have been proposed and used, e.g., Petri nets, BPMN, and process trees. Despite their frequent use, little research addresses the formal properties of process trees and the corresponding potential to improve the efficiency of solving common computational problems. Therefore, in this paper, we propose an invertible state space definition for process trees and demonstrate that the corresponding state space graph is isomorphic to the state space graph of the tree's inverse. Our result supports the development of novel, time-efficient, decomposition strategies for applications of process trees. Our experiments confirm that our state space definition allows for the adoption of bidirectional state space search, which significantly improves the overall performance of state space searches.