scholarly journals Inferring Unobserved Events in Systems with Shared Resources and Queues

2022 ◽  
Vol 183 (3-4) ◽  
pp. 203-242
Author(s):  
Dirk Fahland ◽  
Vadim Denisov ◽  
Wil. M.P. van der Aalst
Keyword(s):  
Material Handling ◽  
Real Life ◽  
Process Models ◽  
Shared Resources ◽  
Compositional Model ◽  
Event Logs ◽  
Event Log ◽  
Baggage Handling ◽  
Process Behavior ◽  
And Performance

To identify the causes of performance problems or to predict process behavior, it is essential to have correct and complete event data. This is particularly important for distributed systems with shared resources, e.g., one case can block another case competing for the same machine, leading to inter-case dependencies in performance. However, due to a variety of reasons, real-life systems often record only a subset of all events taking place. To understand and analyze the behavior and performance of processes with shared resources, we aim to reconstruct bounds for timestamps of events in a case that must have happened but were not recorded by inference over events in other cases in the system. We formulate and solve the problem by systematically introducing multi-entity concepts in event logs and process models. We introduce a partial-order based model of a multi-entity event log and a corresponding compositional model for multi-entity processes. We define PQR-systems as a special class of multi-entity processes with shared resources and queues. We then study the problem of inferring from an incomplete event log unobserved events and their timestamps that are globally consistent with a PQR-system. We solve the problem by reconstructing unobserved traces of resources and queues according to the PQR-model and derive bounds for their timestamps using a linear program. While the problem is illustrated for material handling systems like baggage handling systems in airports, the approach can be applied to other settings where recording is incomplete. The ideas have been implemented in ProM and were evaluated using both synthetic and real-life event logs.

scholarly journals Discovering Object-centric Petri Nets

2020 ◽  
Author(s):  
Wil M.P. van der Aalst ◽  
Alessandro Berti
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Single Case ◽  
Real Life ◽  
Process Models ◽  
Multiple Products ◽  
Event Logs ◽  
Event Log ◽  
Different Types ◽  
Complex Relationships

Techniques to discover Petri nets from event data assume precisely one case identifier per event. These case identifiers are used to correlate events, and the resulting discovered Petri net aims to describe the life-cycle of individual cases. In reality, there is not one possible case notion, but multiple intertwined case notions. For example, events may refer to mixtures of orders, items, packages, customers, and products. A package may refer to multiple items, multiple products, one order, and one customer. Therefore, we need to assume that each event refers to a collection of objects, each having a type (instead of a single case identifier). Such object-centric event logs are closer to data in real-life information systems. From an object-centric event log, we want to discover an object-centric Petri net with places that correspond to object types and transitions that may consume and produce collections of objects of different types. Object-centric Petri nets visualize the complex relationships among objects from different types. This paper discusses a novel process discovery approach implemented in PM4Py. As will be demonstrated, it is indeed feasible to discover holistic process models that can be used to drill-down into specific viewpoints if needed.

scholarly journals The RALph miner for automated discovery and verification of resource-aware process models

2020 ◽  
Vol 19 (6) ◽  
pp. 1415-1441
Author(s):  
Cristina Cabanillas ◽  
Lars Ackermann ◽  
Stefan Schönig ◽  
Christian Sturm ◽  
Jan Mendling
Keyword(s):  
Process Model ◽  
Model Verification ◽  
Process Models ◽  
Resource Assignment ◽  
Process Discovery ◽  
Event Logs ◽  
Different Types ◽  
Automated Discovery ◽  
And Performance ◽  
Resource Aware

Abstract Automated process discovery is a technique that extracts models of executed processes from event logs. Logs typically include information about the activities performed, their timestamps and the resources that were involved in their execution. Recent approaches to process discovery put a special emphasis on (human) resources, aiming at constructing resource-aware process models that contain the inferred resource assignment constraints. Such constraints can be complex and process discovery approaches so far have missed the opportunity to represent expressive resource assignments graphically together with process models. A subsequent verification of the extracted resource-aware process models is required in order to check the proper utilisation of resources according to the resource assignments. So far, research on discovering resource-aware process models has assumed that models can be put into operation without modification and checking. Integrating resource mining and resource-aware process model verification faces the challenge that different types of resource assignment languages are used for each task. In this paper, we present an integrated solution that comprises (i) a resource mining technique that builds upon a highly expressive graphical notation for defining resource assignments; and (ii) automated model-checking support to validate the discovered resource-aware process models. All the concepts reported in this paper have been implemented and evaluated in terms of feasibility and performance.

scholarly journals Database-Less Extraction of Event Logs from Redo Logs

2021 ◽  
pp. 73-82
Author(s):  
Dorina Bano ◽  
Tom Lichtenstein ◽  
Finn Klessascheck ◽  
Mathias Weske
Keyword(s):  
Performance Analysis ◽  
Real World ◽  
Business Processes ◽  
Process Mining ◽  
Detailed Knowledge ◽  
System Failure ◽  
Conformance Checking ◽  
Event Logs ◽  
Event Log ◽  
And Performance

Process mining is widely adopted in organizations to gain deep insights about running business processes. This can be achieved by applying different process mining techniques like discovery, conformance checking, and performance analysis. These techniques are applied on event logs, which need to be extracted from the organization’s databases beforehand. This not only implies access to databases, but also detailed knowledge about the database schema, which is often not available. In many real-world scenarios, however, process execution data is available as redo logs. Such logs are used to bring a database into a consistent state in case of a system failure. This paper proposes a semi-automatic approach to extract an event log from redo logs alone. It does not require access to the database or knowledge of the databaseschema. The feasibility of the proposed approach is evaluated on two synthetic redo logs.

scholarly journals Discovering Block–Structured Parallel Process Models from Causally Complete Event Logs

2016 ◽  
Vol 67 (2) ◽  
pp. 111-123 ◽  
Author(s):  
Julijana Lekić ◽  
Dragan Milićev
Keyword(s):  
Process Model ◽  
Business Processes ◽  
Process Models ◽  
Business Process Models ◽  
Modified Method ◽  
Event Logs ◽  
Event Log ◽  
Partial Correction ◽  
Modified Algorithm ◽  
Block Structured

Abstract α-algorithm is suitable to discover a large class of workflow (WF) nets based on the behaviour recorded in event logs, with the main limiting assumption that the event log is complete. Our research has been aimed at finding ways of discovering business process models based on examples of traces, ie, logs of workflow actions that do not meet the requirement of completeness. In this aim, we have modified the existing and introduced a new relation between activities recorded in the event log, which has led to a partial correction of the process models discovering technique, including the α-algorithm. We have also introduced the notion of causally complete logs, from which our modified algorithm can produce the same result as the α-algorithm from complete logs. The effect of these modifications on the efficiency of the process model discovering is mostly evident for business processes in which many activities can be performed in parallel. The application of the modified method for discovering block-structured models of parallel business processes is presented in this paper.

Process Mining of Event Logs: A Case Study Evaluating Internal Control Effectiveness

2019 ◽  
Vol 33 (3) ◽  
pp. 141-156 ◽  
Author(s):  
Tiffany Chiu ◽  
Mieke Jans
Keyword(s):  
Internal Control ◽  
Process Mining ◽  
Real Life ◽  
Potential Control ◽  
Control Effectiveness ◽  
Event Logs ◽  
Event Log ◽  
New Type ◽  
Potential Risks

SYNOPSISThis paper aims at adopting process mining to evaluate the effectiveness of internal control using a real-life event log. Specifically, the evaluation is based on the full population of an event log and it contains four analyses: (1) variant analysis that identifies standard and non-standard variants, (2) segregation of duties analysis that examines whether employees violate segregation of duties controls, (3) personnel analysis that investigates whether employees are involved in multiple potential control violations, and (4) timestamp analysis that detects time-related issues including weekend activities and lengthy process duration. Results from the case study indicate that process mining could assist auditors in identifying audit-relevant issues such as non-standard variants, weekend activities, and personnel who are involved in multiple violations. Process mining enables auditors to detect potential risks, ineffective internal controls, and inefficient processes. Therefore, process mining generates a new type of audit evidence and could revolutionize the current audit procedure.

scholarly journals Process Discovery of Business Processes Using Temporal Causal Relation

2019 ◽  
Vol 5 (2) ◽  
pp. 183
Author(s):  
Yutika Amelia Effendi ◽  
Nania Nuzulita
Keyword(s):  
Business Process ◽  
Business Processes ◽  
Process Mining ◽  
Causal Relation ◽  
Real Life ◽  
Process Models ◽  
Time Interval ◽  
Start Time ◽  
Process Discovery ◽  
Event Log

Background: Nowadays, enterprise computing manages business processes which has grown up rapidly. This situation triggers the production of a massive event log. One type of event log is double timestamp event log. The double timestamp has a start time and complete time of each activity executed in the business process. It also has a close relationship with temporal causal relation. The temporal causal relation is a pattern of event log that occurs from each activity performed in the process.Objective: In this paper, seven types of temporal causal relation between activities were presented as an extended version of relations used in the double timestamp event log. Since the event log was not always executed sequentially, therefore using temporal causal relation, the event log was divided into several small groups to determine the relations of activities and to mine the business process.Methods: In these experiments, the temporal causal relation based on time interval which were presented in Gantt chart also determined whether each case could be classified as sequential or parallel relations. Then to obtain the business process, each temporal causal relation was combined into one business process based on the timestamp of activity in the event log.Results: The experimental results, which were implemented in two real-life event logs, showed that using temporal causal relation and double timestamp event log could discover business process models.Conclusion: Considering the findings, this study concludes that business process models and their sequential and parallel AND, OR, XOR relations can be discovered by using temporal causal relation and double timestamp event log.Keywords:Business Process, Process Discovery, Process Mining, Temporal Causal Relation, Double Timestamp Event Log

scholarly journals Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory

2022 ◽  
Vol 183 (3-4) ◽  
pp. 293-317
Author(s):  
Anna Kalenkova ◽  
Josep Carmona ◽  
Artem Polyvyanyy ◽  
Marcello La Rosa
Keyword(s):  
Free Choice ◽  
State Of The Art ◽  
Real Life ◽  
Process Models ◽  
Choice Process ◽  
Process Discovery ◽  
Event Logs ◽  
Novel Approach ◽  
Non Local ◽  
Region Theory

State-of-the-art process discovery methods construct free-choice process models from event logs. Consequently, the constructed models do not take into account indirect dependencies between events. Whenever the input behaviour is not free-choice, these methods fail to provide a precise model. In this paper, we propose a novel approach for enhancing free-choice process models by adding non-free-choice constructs discovered a-posteriori via region-based techniques. This allows us to benefit from the performance of existing process discovery methods and the accuracy of the employed fundamental synthesis techniques. We prove that the proposed approach preserves fitness with respect to the event log while improving the precision when indirect dependencies exist. The approach has been implemented and tested on both synthetic and real-life datasets. The results show its effectiveness in repairing models discovered from event logs.

scholarly journals Discovering Object-centric Petri Nets

2020 ◽  
Vol 175 (1-4) ◽  
pp. 1-40
Author(s):  
Wil M.P. van der Aalst ◽  
Alessandro Berti
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Single Case ◽  
Real Life ◽  
Process Models ◽  
Event Data ◽  
Multiple Products ◽  
Event Logs ◽  
Different Types ◽  
Complex Relationships

Techniques to discover Petri nets from event data assume precisely one case identifier per event. These case identifiers are used to correlate events, and the resulting discovered Petri net aims to describe the life-cycle of individual cases. In reality, there is not one possible case notion, but multiple intertwined case notions. For example, events may refer to mixtures of orders, items, packages, customers, and products. A package may refer to multiple items, multiple products, one order, and one customer. Therefore, we need to assume that each event refers to a collection of objects, each having a type (instead of a single case identifier). Such object-centric event logs are closer to data in real-life information systems. From an object-centric event log, we want to discover an object-centric Petri net with places that correspond to object types and transitions that may consume and produce collections of objects of different types. Object-centric Petri nets visualize the complex relationships among objects from different types. This paper discusses a novel process discovery approach implemented in PM4Py. As will be demonstrated, it is indeed feasible to discover holistic process models that can be used to drill-down into specific viewpoints if needed.

scholarly journals Event Log Preprocessing for Process Mining: A Review

2021 ◽  
Vol 11 (22) ◽  
pp. 10556
Author(s):  
Heidy M. Marin-Castro ◽  
Edgar Tello-Leal
Keyword(s):  
Business Process ◽  
Process Model ◽  
Process Mining ◽  
Data Cleaning ◽  
Data Preprocessing ◽  
Process Models ◽  
Event Data ◽  
Event Logs ◽  
Event Log ◽  
Preprocessing Technique

Process Mining allows organizations to obtain actual business process models from event logs (discovery), to compare the event log or the resulting process model in the discovery task with the existing reference model of the same process (conformance), and to detect issues in the executed process to improve (enhancement). An essential element in the three tasks of process mining (discovery, conformance, and enhancement) is data cleaning, used to reduce the complexity inherent to real-world event data, to be easily interpreted, manipulated, and processed in process mining tasks. Thus, new techniques and algorithms for event data preprocessing have been of interest in the research community in business process. In this paper, we conduct a systematic literature review and provide, for the first time, a survey of relevant approaches of event data preprocessing for business process mining tasks. The aim of this work is to construct a categorization of techniques or methods related to event data preprocessing and to identify relevant challenges around these techniques. We present a quantitative and qualitative analysis of the most popular techniques for event log preprocessing. We also study and present findings about how a preprocessing technique can improve a process mining task. We also discuss the emerging future challenges in the domain of data preprocessing, in the context of process mining. The results of this study reveal that the preprocessing techniques in process mining have demonstrated a high impact on the performance of the process mining tasks. The data cleaning requirements are dependent on the characteristics of the event logs (voluminous, a high variability in the set of traces size, changes in the duration of the activities. In this scenario, most of the surveyed works use more than a single preprocessing technique to improve the quality of the event log. Trace-clustering and trace/event level filtering resulted in being the most commonly used preprocessing techniques due to easy of implementation, and they adequately manage noise and incompleteness in the event logs.

scholarly journals Discovering high-level BPMN process models from event data

2019 ◽  
Vol 25 (5) ◽  
pp. 995-1019 ◽  
Author(s):  
Anna Kalenkova ◽  
Andrea Burattin ◽  
Massimiliano de Leoni ◽  
Wil van der Aalst ◽  
Alessandro Sperduti
Keyword(s):  
Process Model ◽  
Process Mining ◽  
Real Life ◽  
Process Models ◽  
Holistic View ◽  
Life Event ◽  
Content Type ◽  
Event Logs ◽  
Wide Range ◽  
High Level

Purpose The purpose of this paper is to demonstrate that process mining techniques can help to discover process models from event logs, using conventional high-level process modeling languages, such as Business Process Model and Notation (BPMN), leveraging their representational bias. Design/methodology/approach The integrated discovery approach presented in this work is aimed to mine: control, data and resource perspectives within one process diagram, and, if possible, construct a hierarchy of subprocesses improving the model readability. The proposed approach is defined as a sequence of steps, performed to discover a model, containing various perspectives and presenting a holistic view of a process. This approach was implemented within an open-source process mining framework called ProM and proved its applicability for the analysis of real-life event logs. Findings This paper shows that the proposed integrated approach can be applied to real-life event logs of information systems from different domains. The multi-perspective process diagrams obtained within the approach are of good quality and better than models discovered using a technique that does not consider hierarchy. Moreover, due to the decomposition methods applied, the proposed approach can deal with large event logs, which cannot be handled by methods that do not use decomposition. Originality/value The paper consolidates various process mining techniques, which were never integrated before and presents a novel approach for the discovery of multi-perspective hierarchical BPMN models. This approach bridges the gap between well-known process mining techniques and a wide range of BPMN-complaint tools.

Sign in / Sign up

Export Citation Format

Share Document