Bridging Imperative Process Models and Process Data Queries-Translation and Relaxation
- URL: http://arxiv.org/abs/2510.06414v1
- Date: Tue, 07 Oct 2025 19:46:36 GMT
- Title: Bridging Imperative Process Models and Process Data Queries-Translation and Relaxation
- Authors: Abdur Rehman Anwar Qureshi, Adrian Rebmann, Timotheus Kampik, Matthias Weidlich, Mathias Weske,
- Abstract summary: In this paper, we provide an approach for translating imperative models into relaxed process data queries.<n>Our results show the continued relevance of imperative process models to data-driven process management.
- Score: 1.8220331982336957
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Business process management is increasingly practiced using data-driven approaches. Still, classical imperative process models, which are typically formalized using Petri nets, are not straightforwardly applicable to the relational databases that contain much of the available structured process execution data. This creates a gap between the traditional world of process modeling and recent developments around data-driven process analysis, ultimately leading to the under-utilization of often readily available process models. In this paper, we close this gap by providing an approach for translating imperative models into relaxed process data queries, specifically SQL queries executable on relational databases, for conformance checking. Our results show the continued relevance of imperative process models to data-driven process management, as well as the importance of behavioral footprints and other declarative approaches for integrating model-based and data-driven process management.
Related papers
- Leveraging Machine Learning and Enhanced Parallelism Detection for BPMN Model Generation from Text [75.77648333476776]
This paper introduces an automated pipeline for extracting BPMN models from text.<n>A key contribution of this work is the introduction of a newly annotated dataset.<n>We augment the dataset with 15 newly annotated documents containing 32 parallel gateways for model training.
arXiv Detail & Related papers (2025-07-11T07:25:55Z) - A Reference Model and Patterns for Production Event Data Enrichment [0.0]
We introduce a reference model and a collection of patterns designed to enrich production event data.<n>The reference model provides a standard way for storing and extracting production event data.<n>The patterns are developed based on empirical observations from event data sets originating in manufacturing processes.
arXiv Detail & Related papers (2025-06-13T06:58:25Z) - Control-flow Reconstruction Attacks on Business Process Models [3.5602253012485656]
This work is the first to empirically investigate such reconstruction attempts based on process models.
We propose different play-out strategies that reconstruct the control-flow from process trees, potentially exploiting frequency annotations.
arXiv Detail & Related papers (2024-09-17T08:42:55Z) - Discovery and Simulation of Data-Aware Business Processes [0.28675177318965045]
This paper introduces a data-aware BPS modeling approach and a method to discover data-aware BPS models from event logs.
The resulting BPS models more closely replicate the process execution control flow relative to data-unaware BPS models.
arXiv Detail & Related papers (2024-08-24T20:13:00Z) - Mining Constraints from Reference Process Models for Detecting Best-Practice Violations in Event Logs [1.1946224276286355]
We propose a framework for mining declarative best-practice constraints from a reference model collection.<n>We demonstrate the capability of our framework to detect best-practice violations through an evaluation based on real-world process model collections and event logs.
arXiv Detail & Related papers (2024-07-02T15:05:37Z) - Adapting Large Language Models for Content Moderation: Pitfalls in Data
Engineering and Supervised Fine-tuning [79.53130089003986]
Large Language Models (LLMs) have become a feasible solution for handling tasks in various domains.
In this paper, we introduce how to fine-tune a LLM model that can be privately deployed for content moderation.
arXiv Detail & Related papers (2023-10-05T09:09:44Z) - Relational Action Bases: Formalization, Effective Safety Verification,
and Invariants (Extended Version) [67.99023219822564]
We introduce the general framework of relational action bases (RABs)
RABs generalize existing models by lifting both restrictions.
We demonstrate the effectiveness of this approach on a benchmark of data-aware business processes.
arXiv Detail & Related papers (2022-08-12T17:03:50Z) - Bellamy: Reusing Performance Models for Distributed Dataflow Jobs Across
Contexts [52.9168275057997]
This paper presents Bellamy, a novel modeling approach that combines scale-outs, dataset sizes, and runtimes with additional descriptive properties of a dataflow job.
We evaluate our approach on two publicly available datasets consisting of execution data from various dataflow jobs carried out in different environments.
arXiv Detail & Related papers (2021-07-29T11:57:38Z) - CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT
(Extended Version) [62.96267257163426]
We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework.
First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case.
Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
arXiv Detail & Related papers (2021-03-18T20:22:50Z) - Petri Nets with Parameterised Data: Modelling and Verification (Extended
Version) [67.99023219822564]
We introduce and study an extension of coloured Petri nets, called catalog-nets, providing two key features to capture this type of processes.
We show that fresh-value injection is a particularly complex feature to handle, and discuss strategies to tame it.
arXiv Detail & Related papers (2020-06-11T17:26:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.