Decomposing Petri nets for process mining: A generic approach

  • Authors:
  • Wil M. Aalst

  • Affiliations:
  • Architecture of Information Systems, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 and International Laboratory of Process-Aware Information Systems, National Research Univer ...

  • Venue:
  • Distributed and Parallel Databases
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The practical relevance of process mining is increasing as more and more event data become available. Process mining techniques aim to discover, monitor and improve real processes by extracting knowledge from event logs. The two most prominent process mining tasks are: (i) process discovery: learning a process model from example behavior recorded in an event log, and (ii) conformance checking: diagnosing and quantifying discrepancies between observed behavior and modeled behavior. The increasing volume of event data provides both opportunities and challenges for process mining. Existing process mining techniques have problems dealing with large event logs referring to many different activities. Therefore, we propose a generic approach to decompose process mining problems. The decomposition approach is generic and can be combined with different existing process discovery and conformance checking techniques. It is possible to split computationally challenging process mining problems into many smaller problems that can be analyzed easily and whose results can be combined into solutions for the original problems.