Table of Contents

Process Discovery Using Integer Linear Programming

J.M.E.M. van der Werf, B.F. van Dongen, C.A.J. Hurkens, A. Serebrenik
In K.M. van Hee, R. Valk (Eds.), Applications and Theory of Petri Nets (29th International Conference, Petri Nets 2008, Xi'an, China, June 23-27, 2008, Proceedings). (Lecture Notes in Computer Science, Vol. 5062, pp. 368-387). Berlin: Springer (DOI 10.1007/978-3-540-68746-7_24)


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 Petri net 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.

Download PDF (544 KB)