PhD Summer School on Process Mining
Bolzano, 29 June - 3 July 2026
Bolzano, 29 June - 3 July 2026
Monday June 29
09:00 – 10:30 Unlocking Process Intelligence A 360 Degree Introduction to Process Mining (Wil van der Aalst)
Description: Process mining serves as the essential bridge between data science and process science, utilizing event data to reveal how operational processes actually function in the real world. This session explores the core pillars of the field—discovery, conformance, and performance—demonstrating how organizations can automatically transform "digital footprints" into actionable insights and process improvements. By examining diverse process modelling notations such as BPMN and Petri nets alongside event data standards such as XES and OCEL, you will learn to navigate end-to-end processes, eliminate bottlenecks, and ensure compliance.
11:00 – 12:30 From Event Logs to Process Logic: The Basics of Process Discovery (Wil van der Aalst)
Description: Process discovery automatically constructs models from event data, yet it must navigate the complex trade-offs between recall, precision, generalization, and simplicity. This session introduces the Directly-Follows Graph (DFG) as a scalable baseline and demonstrates how advanced filtering techniques are essential for isolating dominant behavior from infrequent "noise". We will dive into the core foundations of both bottom-up discovery—uncovering local patterns through the Alpha algorithm—and top-down discovery, which uses inductive mining to recursively decompose logs into sound-by-construction process trees.
14:00 – 15:30 Introduction to Petri Nets (Robin Bergenthum)
Description: This lecture introduces Petri nets as a formalism for modelling and analysing distributed systems, with applications in business process modelling and workflow analysis. It covers both structural and behavioural analysis methods, including properties such as boundedness, reachability, liveness, coverability, as well as P- and T-invariants. Furthermore, the lecture explains how Petri nets model local states, resources, conflicts, and concurrency. Different semantic representations of system behaviour are presented, including step semantics, partially ordered runs, and branching processes, each capturing different behavioural aspects. These concepts provide the formal foundations for the analysis, model checking, verification, and synthesis of distributed systems.
16:00 – 17:30 Modelling with Workflow Nets (Robin Bergenthum)
Description: This lecture focuses on the modelling and analysis of business processes using workflow nets. Building on the foundations introduced in Session 1, the lecture introduces important workflow net concepts and correctness properties, including final states and soundness. The lecture revisits the modelling of control-flow patterns using concepts such as repeated labels and silent transitions and discusses the relationship between workflow nets and BPMN. Furthermore, it presents important extensions of workflow nets, including guarded transitions, stochastic behaviour, and data-aware nets, which are required to represent practical business process scenarios, particularly in the context of process mining.
Tuesday June 30
09:00 – 10:30 Model Discovery (Boudewijn van Dongen)
Description: This session focuses on discovering process models from event data. It introduces the main ideas behind transforming event logs into concrete models, revisits key quality metrics (generalization, precision, recall, and simplicity), and discusses intermediate representations such as directly-follows graphs and relational models. Core discovery algorithms are covered, including the Alpha Miner, Heuristic Miner, process trees, and their relationship to sound workflow nets. The session also presents the Inductive Miner, its extensions, and briefly discusses how it can be applied to discover object-centric Petri nets using the split–discovery–glue approach. Relevant tools are introduced.
11:00 – 12:30 Conformance Checking (Boudewijn van Dongen)
Description: This session introduces conformance checking as a key process mining task. It covers token-replay–based techniques and alignment-based methods. The session also provides a quick overview of potential use cases as well as tool support for conformance checking.
14:00 – 15:30 Process Simulation (Anna Kalenkova)
Description: This session introduces process simulation and simulation models used in the context of PM. It covers some known simulation models used in discrete event simulation, data-driven simulation and more. The session also discusses how to model resources, time, queues and other performance-relevant aspects.
16:00 – 17:30 Process Enhancement, What-If Analysis, and Decision Support (Arik Senderovich)
Description: Building on the preceding session on process simulation, this lecture will focus on how process mining and simulation can be used for process enhancement and operational decision support. The session will be structured around data stories from real cases, mainly from healthcare applications, showing how event-log-based findings such as bottlenecks, waiting times, resource constraints, and slow variants can be translated into intervention hypotheses and evaluated through what-if analysis. I will also demonstrate a real tool for simulation, what-if analysis, and optimization, illustrating how process mining can move from retrospective diagnosis toward comparing feasible operational changes before implementation.
Wednesday July 1
09:00 – 10:30 Foundations of Declarative Process Models (Claudio di Ciccio)
Description: This session provides a brief recap of LTLf and introduces the core properties of declarative process specifications. It discusses notions of equivalence and presents DFA/NFA-based analysis techniques for DECLARE. The session also discusses consistency checking of declarative models (e.g., via their reduction to LTLf satisfiability). Relevant tool support will be covered as well.
11:00 – 12:30 Discovery of declarative models (Claudio di Ciccio)
Description: This session focuses on discovering declarative specifications from event data. It introduces algorithms for the automated extraction of Declare constraints, discusses quality metrics for discovered declarative specifications, and discusses the redundancy and vacuity problems. The session also briefly presents DCR graphs as a more hybrid declarative–procedural approach, illustrates recent advancements in the field, and covers relevant tools.
14:00 – 15:30 Conformance Checking of Declarative Models (Andrea Marrella)
Description: This session covers conformance checking of declarative process models. It introduces finite state automata-based methods to formalize the trace alignment problem and explores AI-driven techniques for efficiently solving this issue and monitoring declarative models at run-time. Relevant tool support will also be covered.
16:00 – 17:30 Experiments in Process Mining (Jana Rehse)
Description: This session focuses on the methodological aspects of (algorithmic) process mining research. It introduces reliability and validity as two basic principles of scientific enquiry and explores how they can be threatened when conducting experiments on process mining algorithms. It then presents a structured methodology for designing and conducting such experiments that researchers can use to mitigate those threats. This methodology is accompanied by a practical checklist to support the planning, execution, and evaluation of experiments in a reliable and valid manner.
19:30 Social dinner at Fink Gasthaus
Description: Just come here and enjoy the dinner!
Thursday July 2
09:00 – 10:30 Distributed Process Mining (Olaf Landsiedel)
Description: Introduction into the concept of distribution; distribution vs. decentralization vs. centralized processing.
11:00 – 12:30 Explainable Process Mining (Agnes Koschmieder)
Description: Introduction into techniques for making process mining results more interpretable and explainable.
14:00 – 15:30 Streaming Process Mining (Andrea Burattin)
Description: This session presents techniques that show how streaming process mining supports real-time insights from continuously generated data.
16:00 – 17:30 Process Mining & Visual Analytics (Jana Rehse)
Description: This session focuses on the interplay of process mining and visual analytics (VA), an interdisciplinary field that combines data visualization, analytical techniques, and interactive interfaces to help people make sense of complex and often large datasets. It introduces the foundations of visualization and VA, including the underlying cognitive principles, as well as procedure models and frameworks that can be used to design and analyze visualizations. It then inspects existing visualizations in the process mining field to identify both strengths and areas of improvement.
Friday July 3
09:00 – 10:30 Object-Centric Process Mining (Dirk Fahland)
Description: Processes and event data in practice typically operate over multiple related objects. This session explores how behavior of such processes is recorded, how to extract event logs, and how flattening into classical logs introduces errors. We then study Object-Centric Event Data (OCED) models that avoid these errors, how to build OCED from source data. We discuss the principles for generalizing classical process mining techniques to Object-Centric Proces Mining technique (OCPM) over OCED for data exploration, process discovery, and performance analysis. We show how OCED allows integration of source data with PM results, enabling new technques such as actor and queue analysis, and new industrially relevant use cases.
11:00 – 12:30 Abstraction in Processes (Xixi Lu)
Description: Introduction to techniques on how complex processes can be made understandable through abstraction.
14:00 – 15:30 Foundations of Privacy-Enhancing Technologies (Florian Tschorsch)
Description: This lecture will provide the foundations of privacy-enhancing technologies by alternating between offensive and defensive perspectives. On the attack side, it will cover techniques such as re-identification; on the defense side, it will introduce mechanisms such as k-anonymity, l-diversity, and differential privacy. Students will develop an understanding of the fundamental privacy–utility trade-off. The session will conclude with a discussion of privacy metrics in process mining, thereby preparing the ground for the next session.
16:00 – 17:30 Event Log Anonymization and Inference Attacks (Stephan Fahrenkrog-Petersen)
Description: A plethora of event log anonymization techniques has been developed by the community, able to provide common privacy guarantees. The lecture will provide an overview of the existing techniques and also include a deep-dive into the anonymization techniques implemented in PM4Py: SaCoFa, SaPa, and PRIPEL. Further, we will provide an outlook on inference attacks on process science artifacts such as process models and schedules. This outlook will demonstrate how inference attacks enable attackers to gain information from indirect data.