scholarly journals Process Discovery of Business Processes Using Temporal Causal Relation

Author(s):  
Yutika Amelia Effendi ◽  
Nania Nuzulita

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

2020 ◽  
Vol 21 (1) ◽  
pp. 126-141
Author(s):  
Yutika Amelia Effendi ◽  
Riyanarto Sarno

A lot of services in business processes lead information systems to build huge amounts of event logs that are difficult to observe. The event log will be analysed using a process discovery technique to mine the process model by implementing some well-known algorithms such as deterministic algorithms and heuristic algorithms. All of the algorithms have their own benefits and limitations in analysing and discovering the event log into process models. This research proposed a new Time-based Alpha++ Miner with an improvement of the Alpha++ Miner and Modified Time-based Alpha Miner algorithm. The proposed miner is able to consider noise traces, loop, and non-free choice when modelling a process model where both of original algorithms cannot override those issues. A new Time-based Alpha++ Miner utilizing Time Interval Pattern can mine the process model using new rules defined by the time interval pattern using a double-time stamp event log and define sequence and parallel (AND, OR, and XOR) relation. The original miners are only able to discover sequence and parallel (AND and XOR) relation. To know the differences between the original Alpha++ Miner and the new one including the process model and its relations, the evaluation using fitness and precision was done in this research. The results presented that the process model obtained by a new Time-based Alpha++ Miner was better than that of the original Alpha++ Miner algorithm in terms of parallel OR, handling noise, fitness value, and precision value. ABSTRAK: Banyak sistem perniagaan perkhidmatan menghasilkan sejumlah besar log data maklumat yang payah dipantau. Log data ini akan dianalisis menggunakan teknik proses penemuan bagi memperoleh model proses dengan menerapkan beberapa algoritma terkenal, seperti algoritma deterministik dan algoritma heuristik. Semua algoritma ini memiliki kehebatan dan kekurangannya dalam menganalisis dan mencari log data ke dalam model proses. Kajian ini mencadangkan Time-based Alpha++ Miner baru yang merupakan pembaharuan dari algoritma Alpha++ Miner dan Modified Time-based Alpha Miner. Algoritma baru ini dapat mempertimbangkan kesan bunyi, pusingan, dan pilihan tidak bebas ketika memodelkan model proses di mana kedua algoritma asal tidak dapat menggantikan isu tersebut. Time-based Alpha++ Miner baru mengguna pakai Pola Interval Waktu berjaya memperoleh model proses menggunakan peraturan baru berdasarkan Pola Interval Waktu menggunakan log peristiwa waktu-ganda dan menentukan jujukan dan hubungan selari (AND, OR, dan XOR). Dibandingkan algoritma asal, ia hanya dapat menemukan jujukan dan hubungan selari (AND dan XOR). Bagi membezakan Alpha++ Miner asal dan yang baru termasuk model proses dan kaitannya, penilaian menggunakan nilai padanan dan penelitian telah dijalankan dalam kajian ini. Hasil kajian model proses yang diperoleh oleh Time-based Alpha++ Miner baru, adalah lebih baik keputusannya berbanding menggunakan algoritma Alpha++ Miner asal, berdasarkan hubungan selari OR, bunyi kawalan, nilai padanan, dan nilai penelitian.


2015 ◽  
Vol 24 (01) ◽  
pp. 1550001 ◽  
Author(s):  
Viara Popova ◽  
Dirk Fahland ◽  
Marlon Dumas

Artifact-centric modeling is an approach for capturing business processes in terms of so-called business artifacts — key entities driving a company's operations and whose lifecycles and interactions define an overall business process. This approach has been shown to be especially suitable in the context of processes where one-to-many or many-to-many relations exist between the entities involved in the process. As a contribution towards building up a body of methods to support artifact-centric modeling, this article presents a method for automated discovery of artifact-centric process models starting from logs consisting of flat collections of event records. We decompose the problem in such a way that a wide range of existing (non-artifact-centric) automated process discovery methods can be reused in a flexible manner. The presented methods are implemented as a package for ProM, a generic open-source framework for process mining. The methods have been applied to reverse-engineer an artifact-centric process model starting from logs of a real-life business process.


2021 ◽  
Author(s):  
Antonia Kaouni ◽  
Georgia Theodoropoulou ◽  
Alexandros Bousdekis ◽  
Athanasios Voulodimos ◽  
Georgios Miaoulis

The increasing amounts of data have affected conceptual modeling as a research field. In this context, process mining involves a set of techniques aimed at extracting a process schema from an event log generated during process execution. While automatic algorithms for process mining and analysis are needed to filter out irrelevant data and to produce preliminary results, visual inspection, domain knowledge, human judgment and creativity are needed for proper interpretation of the results. Moreover, a process discovery on an event log usually results in complicated process models not easily comprehensible by the business user. To this end, visual analytics has the potential to enhance process mining towards the direction of explainability, interpretability and trustworthiness in order to better support human decisions. In this paper we propose an approach for identifying bottlenecks in business processes by analyzing event logs and visualizing the results. In this way, we exploit visual analytics in the process mining context in order to provide explainable and interpretable analytics results for business processes without exposing to the user complex process models that are not easily comprehensible. The proposed approach was applied to a manufacturing business process and the results show that visual analytics in the context of process mining is capable of identifying bottlenecks and other performance-related issues and exposing them to the business user in an intuitive and non-intrusive way.


2020 ◽  
Vol 34 (06) ◽  
pp. 10218-10225 ◽  
Author(s):  
Fabrizio M Maggi ◽  
Marco Montali ◽  
Rafael Peñaloza

Temporal logics over finite traces have recently seen wide application in a number of areas, from business process modelling, monitoring, and mining to planning and decision making. However, real-life dynamic systems contain a degree of uncertainty which cannot be handled with classical logics. We thus propose a new probabilistic temporal logic over finite traces using superposition semantics, where all possible evolutions are possible, until observed. We study the properties of the logic and provide automata-based mechanisms for deriving probabilistic inferences from its formulas. We then study a fragment of the logic with better computational properties. Notably, formulas in this fragment can be discovered from event log data using off-the-shelf existing declarative process discovery techniques.


2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Shabnam Shahzadi ◽  
Xianwen Fang ◽  
David Anekeya Alilah

For exploitation and extraction of an event’s data that has vital information which is related to the process from the event log, process mining is used. There are three main basic types of process mining as explained in relation to input and output. These are process discovery, conformance checking, and enhancement. Process discovery is one of the most challenging process mining activities based on the event log. Business processes or system performance plays a vital role in modelling, analysis, and prediction. Recently, a memoryless model such as exponential distribution of the stochastic Petri net SPN has gained much attention in research and industry. This paper uses time perspective for modelling and analysis and uses stochastic Petri net to check the performance, evolution, stability, and reliability of the model. To assess the effect of time delay in firing the transition, stochastic reward net SRN model is used. The model can also be used in checking the reliability of the model, whereas the generalized stochastic Petri net GSPN is used for evaluation and checking the performance of the model. SPN is used to analyze the probability of state transition and the stability from one state to another. However, in process mining, logs are used by linking log sequence with the state and, by this, modelling can be done, and its relation with stability of the model can be established.


2013 ◽  
Vol 22 (01) ◽  
pp. 1350005
Author(s):  
RICARDO PÉREZ-CASTILLO ◽  
MARIO PIATTINI ◽  
BARBARA WEBER

Concept location is a key activity during software modernization since it allows maintainers to exactly determine what pieces of source code support a specific concept. Real-world business processes and information systems providing operational IT support for respective processes can be misaligned as a consequence of uncontrolled maintenance over time. When concepts supported by an information system are getting outdated or misaligned, concept location becomes a time-consuming and error-prone task. Moreover, enterprise information systems (which implement business processes) embed significant business knowledge over time that is neither present nor documented anywhere else. To support the evolution of existing information systems, the embedded knowledge must first be retrieved and depicted in up-to-date business process models and then be mapped to the source code. This paper addresses this issue through a concept location approach that considers business activities as the key concept to be located and discovers different partial business process views for each piece of source code. Thus, the concept location problem becomes the problem of extracting such views. This approach follows model-driven development principles and an automatic model transformation is implemented to facilitate its adoption. Moreover, a case study involving two real-life information system demonstrates its feasibility.


2021 ◽  
Vol 11 (4) ◽  
pp. 1876
Author(s):  
Julijana Lekić ◽  
Dragan Milićev ◽  
Dragan Stanković

Programming by demonstration (PBD) is a technique which allows end users to create, modify, accommodate, and expand programs by demonstrating what the program is supposed to do. Although the ideal of common-purpose programming by demonstration or by examples has been rejected as practically unrealistic, this approach has found its application and shown potentials when limited to specific narrow domains and ranges of applications. In this paper, the original method of applying the principles of programming by demonstration in the area of process mining (PM) to interactive construction of block-structured parallel business processes models is presented. A technique and tool that enable interactive process mining and incremental discovery of process models have been described in this paper. The idea is based on the following principle: using a demonstrational user interface, a user demonstrates scenarios of execution of parallel business process activities, and the system gives a generalized model process specification. A modified process mining technique with the α|| algorithm applied on weakly complete event logs is used for creating parallel business process models using demonstration.


Author(s):  
Yaghoub Rashnavadi ◽  
Sina Behzadifard ◽  
Reza Farzadnia ◽  
Sina Zamani

Communication is indispensable for today's lifestyle, and thanks to technology, millions of people can communicate as quickly as possible. The effect of this breakthrough has transformed organizations to the degree that they generate billions of emails daily to facilitate their operations. There is implicit information behind this vast corpus of human-generated content that can be mined and used for their benefit. This paper tries to address the opportunity that email logs can bring to organizations and propose an approach to discover process models by combining supervised text classification and process mining. This framework consists of two main steps, text classification, and process mining. First, Emails will be classified with supervised machine learning, and to mine, the processes fuzzy Miner is used. To further investigate the application of this framework, we also applied this framework over a real-life dataset from a case study organization.


2021 ◽  
Vol 16 ◽  
pp. 1-14
Author(s):  
Zineb Lamghari

Process discovery technique aims at automatically generating a process model that accurately describes a Business Process (BP) based on event data. Related discovery algorithms consider recorded events are only resulting from an operational BP type. While the management community defines three BP types, which are: Management, Support and Operational. They distinguish each BP type by different proprieties like the main business process objective as domain knowledge. This puts forward the lack of process discovery technique in obtaining process models according to business process types (Management and Support). In this paper, we demonstrate that business process types can guide the process discovery technique in generating process models. A special interest is given to the use of process mining to deal with this challenge.


Author(s):  
Alessandro Marchetto ◽  
Chiara Di Francescomarino

Web Applications (WAs) have been often used to expose business processes to the users. WA modernization and evolution are complex and time-consuming activities that can be supported by software documentation (e.g., process models). When, as often happens, documentation is missing or is incomplete, documentation recovery and mining represent an important opportunity for reconstructing or completing it. Existing process-mining approaches, however, tend to recover models that are quite complex, rich, and intricate, thus difficult to understand and use for analysts and developers. Model refinement approaches have been presented in the literature to reduce the model complexity and intricateness while preserving the capability of representing the relevant information. In this chapter, the authors summarize approaches to mine first and refine later business process models from existing WAs. In particular, they present two process model refinement approaches: (1) re-modularization and (2) reduction. The authors introduce the techniques and show how to apply them to WAs.


Sign in / Sign up

Export Citation Format

Share Document