In an increasingly digital world, collecting, processing, and exchanging personal data are critical drivers for enacting enterprise business processes. However, the long-term retention and access of personal data expose organizations to data breaches, in which sensitive and protected data are disclosed and exploited unauthorizedly. To mitigate the damage that data breaches can cause, in the European Union (EU), the right to data privacy is enforced through the General Data Protection Regulation (GDPR), which defines how organizations must store and manage EU citizens’ data. GDPR is highly influencing how organizations approach data privacy, forcing them to rethink and upgrade their business processes to become GDPR compliant, which can be daunting. In this paper, in line with the privacy-by-design principles of GDPR, we propose a methodology that shows how to capture the main privacy GDPR constraints in the form of design patterns and integrate them into business process models specified in BPMN (Business Process Model and Notation). This allows us to achieve full transparency of privacy constraints in business processes, making it possible to ensure their compliance with GDPR at design-time. We adopt a design science research approach to present our methodology and make design decisions explicit. We also introduce GDPR-Pilot, a BPMN editor that assists process designers and Data Controllers in integrating GDPR patterns into existing models. The methodology is evaluated through real-world use cases against structural, usage, and environmental requirements.

Organizations increasingly rely on Process Performance Indicators (PPIs) to evaluate how effectively their business processes achieve strategic and operational goals. Recent approaches compute PPIs directly from event logs leveraging the increasing availability of event data in organizations, but they assume that PPIs have been previously defined using well-established reference models and that their linkage to the event log has been explicitly specified. However, this definition of appropriate PPIs remains challenging, as managers often lack detailed insights into real process executions and must adapt generic frameworks to organizational contexts. To address this gap, this paper introduces PPIPilot, an approach and tool that supports managers in defining measurable PPIs by suggesting a set of relevant PPIs and their computations directly from a business process description, an associated event log, and a specified organizational goal. PPIPilot leverages large language models for contextual PPI suggestion and structured translation, operating through a three-component pipeline of suggestion, translation, and computation, with a fallback mechanism to address computation errors. The quantitative evaluation shows that PPIPilot has a strong ability to suggest and compute PPIs, and that the fallback mechanism reduces failures, increasing the share of PPIs that can be computed without errors. Complementing these findings, an in-depth qualitative study indicates that users find the tool intuitive, transparent and helpful for easing both the conceptual and technical challenges of defining PPIs.

The Business Process Modeling Notation (BPMN) is the de facto standard for business process modeling. While widely adopted for its intuitive graphical notation, its execution semantics described in natural language lacks a commonly agreed formal foundation, leading to variability in execution across different BPM systems (BPMSs) and increasing the risk of creating models with semantic errors costly to correct at runtime. Although many formalisms have been used to model portions of BPMN, their reasoning capabilities are mostly restricted to control-flow, making them unsuitable for semantic analysis where data and global exception handling play a central role in execution. To address this, we propose a formalization from BPMN to ConGolog, a logical concurrent processes language based on the Situation Calculus, for representing and reasoning about dynamic domains. A major innovation is using ConGolog to rigorously capture the semantics of BPMN global exceptions. Our framework supports advanced reasoning, allowing for semantic analysis of BPMN models before execution to predict runtime errors within a safe simulation setting, while laying the foundation for reasoning layers in next-generation AI-augmented BPMSs. We validate the approach through a prototype and comprehensive evaluation, demonstrating the computational feasibility of the translation and the semantic correctness of reasoning tasks.

Within the process mining field, Deterministic Finite State Automata (DFAs) are largely employed as foundation mechanisms to perform formal reasoning tasks over the information contained in the event logs, such as conformance checking, compliance monitoring and cross-organization process analysis, just to name a few. To support the above use cases, in this paper, we investigate how to leverage Model Learning (ML) algorithms for the automated discovery of DFAs from event logs. DFAs can be used as a fundamental building block to support not only the development of process analysis techniques, but also the implementation of instruments to support other phases of the Business Process Management (BPM) lifecycle such as business process design and enactment. The quality of the discovered DFAs is assessed wrt customized definitions of fitness, precision, generalization, and a standard notion of DFA simplicity. Finally, we use these metrics to benchmark ML algorithms against real-life and synthetically generated datasets, with the aim of studying their performance and investigate their suitability to be used for the development of BPM tools.

Declarative business process (BP) models define the behavior of BPs as a set of temporal constraints, which can be summarized as a deterministic finite state automaton (DFA). Declarative BP discovery aims at inferring such constraints from event logs. To this aim, it requires as additional input the set of candidate constraints to be verified with respect to the event log. Intuitively, this restricts the discovery task to a conformance checking activity between a predefined set of constraint templates and an event log, preventing to learn any observed behavior that is not captured by those templates. In this paper, we investigate how to leverage Model Learning (ML) for the automated discovery of the DFA underlying the behavior of a declarative BP model, without using any further a-priori information in addition to the event log. To assess the quality of the discovered DFA, we introduce a novel definition of the standard process mining quality metrics, i.e., precision, generalization and simplicity, tailored to DFAs. Finally, a preliminary evaluation performed with real-life logs shows that ML enables to generate extremely simpler DFAs than state-of-the-art BP declarative discovery techniques, keeping similar values of precision and generalization.