Process Discovery using Integer Linear Programming

Issue title: Petri Nets 2008

Article type: Research Article

Authors: van derWerf, J.M.E.M. | van Dongen, B.F. | Hurkens, C.A.J. | Serebrenik, A.

Affiliations: Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. E-mail: {j.m.e.m.v.d.werf, b.f.v.dongen,c.a.j.hurkens,a.serebrenik}@tue.nl

Abstract: The research domain of process discovery aims at constructing a process model (e.g. a Petri net) which is an abstract representation of an execution log. Such a model should (1) be able to reproduce the log under consideration and (2) be independent of the number of cases in the log. In this paper, we present a process discovery algorithm where we use concepts taken from the language-based theory of regions, a well-known Petri net research area. We identify a number of shortcomings of this theory from the process discovery perspective, and we provide solutions based on integer linear programming.

DOI: 10.3233/FI-2009-136

Journal: Fundamenta Informaticae, vol. 94, no. 3-4, pp. 387-412, 2009