arXiv AI

Monotonicity-Guided Bottom-Up Petri Net Discovery: The SPECpp Framework

arXiv:2608. 09398v1 Announce Type: cross Abstract: Process discovery is one of the central challenges in process mining.

arXiv AI
Sep 18

PetriBench: Benchmarking LLM Reasoning over Dynamic State Spaces

PetriBench is a compact, fully self‑contained, and scalable benchmark that evaluates large language model (LLM) reasoning over dynamic state spaces using Petri nets. It organizes reasoning into four task families with Easy, Medium, and Hard levels, each generated by increasing structural complexity and evaluated against exact ground truth. Experiments across proprietary and open‑weight models show that accuracy consistently drops with difficulty, revealing distinct task‑specific capability profiles, while test‑time compute and procedural generation affect performance differently across tasks.

By Pyrros Koussios, Benjamin J\"ager, John Hua Yao, Ajay Sridhar, Violet Xiang, Chenhao Li
arXiv Machine Learning
Sep 22

Concurrency-Aware Process Model Forecasting with Causal Nets

The paper introduces a new approach to process model forecasting that uses causal nets instead of traditional directly-follows graphs, enabling explicit representation of concurrency. It forecasts time series of relation and binding counts, reconstructs future process models with AND/XOR semantics, and evaluates them using a protocol that handles partial traces for conformance checking. Experiments on four event logs show that the forecasted models achieve conformance close to re‑mined models and outperform static discovery baselines, though filtering infrequent bindings improves metrics at the cost of losing concurrent behavior.

By Yongbo Yu, Jari Peeperkorn, Johannes De Smedt, Jochen De Weerdt
Hugging Face Trending Papers
Sep 17

Resolution limits for process comparison from event data

The paper examines how event data from hospital processes can obscure whether activities occur concurrently or sequentially. It shows that standard event‑log approaches, based on stochastic language, often fail to distinguish concurrency because any log can be explained by a model with no concurrent events. The authors argue that the key to resolving this ambiguity lies in the choice of what is recorded—such as precise start and end times or object‑centric ordering—rather than simply collecting more data.

arXiv Machine Learning
Sep 18

Resolution limits for process comparison from event data

The paper examines how event logs used in process mining can fail to reveal concurrent versus sequential activities, using a hospital example where blood tests and imaging may occur simultaneously or in alternating order. It demonstrates that standard stochastic language approaches only expose the assumptions of their discovery algorithms, often misrepresenting concurrency. The authors argue that the key to distinguishing concurrent behavior lies in the choice of recorded data—such as precise start and end times or object‑centric ordering—rather than simply increasing sample size.

By Antony R. Lee, Peter Ti\v{n}o, Iain B. Styles
arXiv AI
Sep 2

Automated Event Log Generation from Unstructured Text Using Finetuned LLMs

The paper introduces a scalable framework that uses finetuned large language models (LLMs) to translate unstructured textual resources into structured event logs for process mining. By creating a new text-to-log dataset and finetuning LLMs on it, the authors demonstrate that the resulting models produce high‑fidelity event logs, outperforming few‑shot or zero‑shot prompting methods. This approach enables previously unused organizational data, such as incident tickets and manuals, to be incorporated into process mining workflows.

By Maximilian Seeth, Gabriel Marques Tavares, Daniel Schuster