Abstract

This work is dedicated to one of the most urgent problems in the field of process mining. Process mining is a technique that offers plenty of methods for the discovery and analysis of business processes based on event logs. However, there is a lack of real process models and event logs, which can be used to verify the methods developed to achieve process mining goals. Hence, there is a need in an instrument that would generate process models and logs, thus allowing verification of the process mining discovery algorithms. This aim can be reached by the creation of a model and log generator. In this paper a possible solution for the creation of such a generator will be proposed. Namely, it is the generation of process models and event logs using the rules of graph grammars on the example of structured workflow nets. The approach proposed is based on the creation of grammar rules to generate a model and an event log, which fits this model. The evaluation of the process discovery algorithms will be available due to the presence of initial models and event logs generated on the basis of these models. The tools used to perform this work are publicly available. This paper is the research-in-progress, which is conducted in frame of master’s thesis in the field of software engineering.

Highlights

  • Process mining [1] is a process management technique that allows the analysis of business processes based on event logs

  • We have demonstrated the key principles of applying graph grammar for model creation

  • In frames of this study graph grammars for structured WFnets and log generation were developed

Read more

Summary

INTRODUCTION

Process mining [1] is a process management technique that allows the analysis of business processes based on event logs. The second requirement (ii) (the Petri net extended with t* should be strongly connected), states that for each transition t (place p ) there should be directed path from place i to o via t ( p ). This requirement has been added to avoid dangling nodes, i.e. tasks and conditions which do not contribute to the processing of cases [2]. The main advantage of the approach presented in this paper is that we use an external tool to generate models, which allows working with arbitrary graph grammars. We propose an approach for a log generation based on graph grammars as well

GRAPH GRAMMAR
LOG GENERATION
APPLYING THE APPROACH IN FRAMES OF PROCESS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call