Business process management employs process models and event logs to represent the behavior of the information systems under study. Traditional case-centric notions consider the order of activities and events in isolated process instances. The emerging field of object-centric processes challenges this assumption by putting objects in the center. Object-centric process mining and modeling approaches identify the structure of co-evolving data objects that influence the behavior of an information system to provide a comprehensive view of the system behavior. Object-centricity has been investigated independently in process modeling and in process mining, which resulted in the coexistence of seemingly contradictory assumptions and definitions. As a community effort, this research manifesto relates and aligns existing terminologies, definitions, and perspectives to provide a common ground for current and future research in object-centric business process management. Based on the current state of research, we propose a conceptualization that sets process models and event logs in relation to the information system’s behavior and the execution data it generates. The conceptualization aims at aligning different terminologies and, thus, providing a basis to model and analyze behavioral characteristics. Building on this common ground, we identify open research challenges along the most relevant research areas in object-centric process management. For each research area, its current status is investigated and an outline of the most relevant research challenges is presented.

Both the fields of Process Mining (PM) and Visual Analytics (VA) aim to make complex phenomena understandable. In PM, the goal is to gain insights into the execution of complex processes by analyzing the event data that is captured in event logs. This data is inherently multi-faceted, meaning that it covers various data facets, including spatial and temporal dependencies, relations between data entities (such as cases/events), and multivariate data attributes per entity. However, the multi-faceted nature of the data has not received much attention in PM. Conversely, VA research has investigated interactive visual methods for making multi-faceted data understandable for about two decades. In this study, we bring together PM and VA with the goal of advancing toward Visual Process Analytics (VPA) of multi-faceted processes. To this end, we present a systematic view of relevant (VA) data facets in the context of PM and assess to what extent existing PM visualizations address the data facets’ characteristics, making use of VA guidelines. In addition to visualizations, we look at how PM can benefit from analytical abstraction and interaction techniques known in the VA realm. Based on this, we discuss open challenges and opportunities for future research towards multi-faceted VPA.

In many real-world scenarios, processes naturally define partial orders over their constituent tasks. Partially ordered representations can be exploited in process discovery as they facilitate modeling such processes. The Partially Ordered Workflow Language (POWL) extends partially ordered representations with control-flow operators to support modeling common process constructs such as choice and loop structures. POWL integrates the hierarchical nature of process trees with the flexibility of partially ordered representations, opening up significant opportunities in process discovery. This paper presents and compares various approaches for the automated discovery of POWL models. We investigate the effects of applying varying validity criteria to partial orders, and we propose methods for incorporating frequency information to improve the quality of the discovered models. Additionally, we propose alternative visualizations for POWL models, offering different approaches that may be useful in various contexts. The discovery approaches are evaluated using various real-life data sets, demonstrating the ability of POWL models to capture complex process structures. • Employing different validity requirements in the discovery of POWL models. • Incorporating frequency-based filtering in the discovery of POWL models. • Enhancing the visualization of the discovered models. • Proving the soundness of the discovered models.

The execution of operational processes generates event data stored in enterprise information systems. Process mining techniques analyze such event data to obtain insights vital for decision-makers to improve the reviewed process. In this context, event data visualizations are essential. We focus on visualizing variants describing process executions that are control flow equivalent. Such variants are an integral concept for process mining and are used, e.g., for data exploration and filtering. We propose high-level and low-level variants covering different levels of abstraction and present corresponding visualizations. Compared to existing variant visualizations, we support partially ordered event data and allow for heterogeneous temporal information per event, i.e., we support both time intervals and time points. We evaluate our contributions using automated experiments showing practical applicability to real-life event data. Finally, we present a user study indicating significantly improved usefulness and ease of use of the proposed high-level variant visualization compared to existing variant visualizations for typical analysis tasks.

Abstract Predictive process monitoring is a subfield of process mining that aims to estimate case or event features for running process instances. Such predictions are of significant interest to the process stakeholders. However, most of the state-of-the-art methods for predictive monitoring require the training of complex machine learning models, which is often inefficient. Moreover, most of these methods require a hyper-parameter optimization that requires several repetitions of the training process which is not feasible in many real-life applications. In this paper, we propose an instance selection procedure that allows sampling training process instances for prediction models. We show that our instance selection procedure allows for a significant increase of training speed for next activity and remaining time prediction methods while maintaining reliable levels of prediction accuracy.

Abstract The field of process mining focuses on distilling knowledge of the (historical) execution of a process based on the operational event data generated and stored during its execution. Most existing process mining techniques assume that the event data describe activity executions as degenerate time intervals, i.e., intervals of the form [ t , t ], yielding a strict total order on the observed activity instances. However, for various practical use cases, e.g., the logging of activity executions with a nonzero duration and uncertainty on the correctness of the recorded timestamps of the activity executions, assuming a partial order on the observed activity instances is more appropriate. Using partial orders to represent process executions, i.e., based on recorded event data, allows for new classes of process mining algorithms, i.e., aware of parallelism and robust to uncertainty. Yet, interestingly, only a limited number of studies consider using intermediate data abstractions that explicitly assume a partial order over a collection of observed activity instances. Considering recent developments in process mining, e.g., the prevalence of high-quality event data and techniques for event data abstraction, the need for algorithms designed to handle partially ordered event data is expected to grow in the upcoming years. Therefore, this paper presents a survey of process mining techniques that explicitly use partial orders to represent recorded process behavior. We performed a keyword search, followed by a snowball sampling strategy, yielding 68 relevant articles in the field. We observe a recent uptake in works covering partial-order-based process mining, e.g., due to the current trend of process mining based on uncertain event data. Furthermore, we outline promising novel research directions for the use of partial orders in the context of process mining algorithms.

The execution of (business) processes often deviates from their behavioral specification (e.g., captured in a BPMN model). Conformance checking techniques evaluate whether event logs, i.e., data records capturing process behavior, and process models conform to each other. As such, conformance checking techniques provide insights into the correctness of the process execution. Alignments are conformance checking artifacts used to compute conformance metrics and, particularly, diagnostics. Several alignment algorithms exist, yet most existing methods solve an underlying search problem in which one typically calculates a heuristic to guide the search. Recently, a promising novel search approach was presented that reduces the overall number of heuristics required to solve the alignment problem. This paper extends this approach by proposing a caching strategy that improves the overall search speed and efficiency. We conducted a large set of experiments, confirming that the overall search efficiency increases significantly due to our contribution.

Process mining allows one to analyze and extract knowledge from event data, i.e., records of process executions stored in information systems. Most process mining techniques are directly applied to the data as recorded in the system. Applying automated process discovery techniques, i.e., a core process mining technology, directly on such data yields complex process models describing millions of different execution paths. Other techniques applied to such discovered process models and system-level data, e.g., conformance checking or performance analysis techniques, often generate complex and over-detailed results. The results obtained by directly applying process mining techniques on system-level data are, therefore, hard to interpret by a human analyst and greatly differ from the business level. Therefore, in this paper, we propose a generic hierarchical framework for event abstraction. We formalize the framework, which uses the notion of activity instances as an input and allows for hierarchical abstraction of event data. In addition, we propose an instantiation of the framework, which describes two key functions of the framework, i.e., abstract concept identification and abstract entity extraction. The framework, together with the instantiation, is evaluated both quantitatively and qualitatively. The experiments show that, without compromising the quality of results, the abstraction allows users to easier analyze a process.

Process mining techniques aim to derive knowledge of the execution of processes, by means of automated analysis of behaviour recorded in event logs. A well-known challenge in process mining is to strike an adequate balance between the behavioural quality of a discovered model compared to the event log and the model's complexity as perceived by stakeholders. At the same time, events typically contain multiple attributes related to parts of the process at different levels of abstraction, which are often ignored by existing process mining techniques, resulting in either highly complex and/or incomprehensible process mining results. This paper addresses this problem by extending process mining to use event-level attributes readily available in event logs. We introduce (1) the concept of multi-level logs and generalise existing hierarchical process models, which support multiple modelling formalisms and notions of activities in a single model, (2) a framework, instantiation and implementation for process discovery of hierarchical models, and (3) a corresponding conformance checking technique. The resulting framework has been implemented as a plug-in of the open-source process mining framework ProM, and has been evaluated qualitatively and quantitatively using multiple real-life event logs.

Conformance checking techniques are used to compute to what degree a process model and real execution data correspond to each other. In recent years, alignments have proven to be useful for calculating conformance statistics. Most alignment techniques provide an exact conformance value. However, in many applications, it suffices to have an approximated alignment value. Specifically, for large event data and using standard hardware, current alignment techniques are time-consuming and sometimes intractable. This paper proposes to use simulated behaviors of process models to approximate the conformance checking value. To simulate a process model, we exploit the behavior in the given event data. This method is independent from the process model notation and provides upper and lower bounds for the approximated alignment value. We assess the quality of our approximations and compare it to existing approximation techniques. The experiments on real event data show that using the proposed method, it is possible to achieve significant performance improvements.

The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business process. In this paper, we focus on process discovery relying on online streams of business process execution events. Learning process models from event streams poses both challenges and opportunities, i.e. we need to handle unlimited amounts of data using finite memory and, preferably, constant time. We propose a generic architecture that allows for adopting several classes of existing process discovery techniques in context of event streams. Moreover, we provide several instantiations of the architecture, accompanied by implementations in the process mining toolkit ProM ( http://promtools.org ). Using these instantiations, we evaluate several dimensions of stream-based process discovery. The evaluation shows that the proposed architecture allows us to lift process discovery to the streaming domain.