Discovering Petri nets from event logs

28Citations
Citations of this article
58Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As information systems are becoming more and more intertwined with the operational processes they support, multitudes of events are recorded by todays information systems. The goal of process mining is to use such event data to extract process related information, e.g., to automatically discover a process model by observing events recorded by some system or to check the conformance of a given model by comparing it with reality. In this article, we focus on process discovery, i.e., extracting a process model from an event log. We focus on Petri nets as a representation language, because of the concurrent and unstructured nature of real-life processes. The goal is to introduce several approaches to discover Petri nets from event data (notably the α-algorithm, state-based regions, and language-based regions). Moreover, important requirements for process discovery are discussed. For example, process mining is only meaningful if one can deal with incompleteness (only a fraction of all possible behavior is observed) and noise (one would like to abstract from infrequent random behavior). These requirements reveal significant challenges for future research in this domain. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Van Der Aalst, W. M. P., & Van Dongen, B. F. (2013). Discovering Petri nets from event logs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7480 LNCS, pp. 372–422). Springer Verlag. https://doi.org/10.1007/978-3-642-38143-0_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free