Detecting Implicit Dependencies Between Tasks from Event Logs
Process mining aims at extracting information from event logs to capture the business process as it is being executed. In spite of many researchers’ persistent efforts, there are still some challenging problems to be solved. In this paper, we focus on mining non-free-choice constructs, where the process models are represented in Petri nets. In fact, there are totally two kinds of causal dependencies between tasks, i.e., explicit and implicit ones. Implicit dependency is very hard to mine by current mining approaches. Thus we propose three theorems to detect implicit dependency between tasks and give their proofs. The experimental results show that our approach is powerful enough to mine process models with non-free-choice constructs.
Unable to display preview. Download preview PDF.
- 5.van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems, and Computers 8(l), 21–66 (1998)Google Scholar
- 7.de Medeiros, A.K.A., van Dongen, B.F., van der Aalst, W.M.P., Weijters, A.J.M.M.: Process Mining for Ubiquitous Mobile Systems: An Overview and a Concrete Algorithm. In: UMICS, pp. 151–165 (2004)Google Scholar
- 13.Lijie, W., Jianmin, W., van der Aalst, W.M.P., Zhe, W., Jiaguang, S.: A Novel Approach for Process Mining Based on Event Types. BETA Working Paper Series, WP 118, Eindhoven University of Technology, Eindhoven (2004)Google Scholar