EDBT 2026 Demo / reviewers in the wild / expert
Adam Burke 0001
dblp:15/4578-1 · also Adam T. Burke
· DBLP profile ↗
5ranked-venue papers in the field
3as first author
5since 2021 · last 2025
0000-0003-4407-2199ORCID · verified
Domains — venue-derived; a paper can count in several
Business Process & Enterprise Data · 4 (2 first)Database Systems & Data Management · 1 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Skip Probabilities for SubprocessesabstractConformance checking techniques compare process models of organizational behavior with observed process executions to reveal their deviations. Traditional alignments concern individual activities and provide a single out of potentially infinitely many explanations for observed deviations. Skip alignments lift insights to subprocesses and provide all possible explanations. Though valuable for analysts and process mining tools, there exist no interpretations how likely these deviations are. In this paper, we introduce skip probabilities revealing how likely certain subprocesses deviate w.r.t. an event log of observed process executions. We show the formal derivation of this calculation and demonstrate the feasibility of its computation. By analyzing a realistic case, we empirically show that yet hidden process insights can be derived from skip probabilities and how they contribute to targeted process improvement. Philipp Bär, Adam Burke 0001, Moe Thandar Wynn, Sander J. J. Leemans |
ICPM | 2 |
| 2024 | Navigating Complexity: Comparing Complexity Measures With Weyuker's PropertiesabstractA good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect the complexity of a model with a numeric score. However, this abundance of different complexity measures makes it difficult to select one for analysis. Furthermore, most complexity measures are defined only for BPMN or EPC, but not for workflow nets.This paper adapts existing complexity measures to the world of workflow nets. It then compares these measures with a set of properties originally defined for software complexity, as well as new extensions to it. We discuss the importance of the properties in theory by evaluating whether matured complexity measures should fulfill them or whether they are optional. We find that not all inspected properties are mandatory, but also demonstrate that the behavior of evolutionary process discovery algorithms is influenced by some of these properties. Our findings help analysts to choose the right complexity measure for their specific use-case. Patrizia Schalk, Adam Burke 0001, Robert Lorenz 0001 |
ICPM | 2 |
| 2024 | A chance for models to show their quality: Stochastic process model-log dimensionsabstractProcess models describe the desired or observed behaviour of organisations. In stochastic process mining, computational analysis of trace data yields process models which describe process paths and their probability of execution. To understand the quality of these models, and to compare them, quantitative quality measures are used. This research investigates model comparison empirically, using stochastic process models built from real-life logs. The experimental design collects a large number of models generated randomly and using process discovery techniques. Twenty-five different metrics are taken on these models, using both existing process model metrics and new, exploratory ones. The results are analysed quantitatively, making particular use of principal component analysis. Based on this analysis, we suggest three stochastic process model dimensions: adhesion, relevance and simplicity. We also suggest possible metrics for these dimensions, and demonstrate their use on example models. Adam Burke 0001, Sander J. J. Leemans, Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede |
Inf. Syst. | 1 |
| 2023 | State Snapshot Process Discovery on Career Paths of Qing Dynasty Civil ServantsabstractIn process mining, computational processing of sequential data allows the discovery and analysis of processes followed by organisations. These can be either explicitly understood processes, captured in documents or rules, or implicit process paths known in more informal or emergent ways. This paper examines a long-lived institution of historical interest, the Qing (1644-1911) Chinese civil service, using data assembled by historians on civil officials during the 19th century. Mapping the promotion process by following paths of officials through civil service postings helps illuminate the everyday operation of the institution and the society around it. Two distinctive features of this data set are that it records states, not events, and careers often include holding multiple concurrent roles. The combination is a poor match for existing process discovery techniques. We describe this structure as a state snapshot log, and present a new discovery technique, the State Snapshot miner, for constructing stochastic Petri net models from such logs. A case study shows its use in analysing promotion paths for elite graduates in the Qing civil service. Adam Burke 0001, Sander J. J. Leemans, Moe Thandar Wynn, Cameron D. Campbell |
ICPM | 1 |
| 2022 | Stochastic Process Model-Log Quality Dimensions: An Experimental StudyabstractStochastic process models are a type of model that explicitly include elements of probability in describing an organization, facilitating different modes of analysis and simulation. Having obtained models of an organizational process, say through process mining, using them well depends on understanding their quality, and being able to compare different models. There may not be a single optimal stochastic model for a process, but tradeoffs between models, decided by their intended use. Reasoning about trade-offs in a precise way requires quantitative measures, and an understanding of how these measures relate, including whether they capture independent underlying properties.This paper is an empirical investigation of measures for stochastic process models built from real-life logs. The experimental design assembles a large collection of models built both randomly and by discovery techniques. A wide spectrum of candidate measures, drawn from and inspired by the process mining literature, are applied using these models. Based on this analysis, three stochastic quality dimensions are proposed: adhesion, entropy and simplicity. Adam Burke 0001, Sander J. J. Leemans, Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede |
ICPM | 1 |