Process Discovery Using Integer Linear Programming

  • Authors:
  • J. M. Werf;B. F. Dongen;C. A. Hurkens;A. Serebrenik

  • Affiliations:
  • Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 5600 MB;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 5600 MB;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 5600 MB;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 5600 MB

  • Venue:
  • PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The research domain of process discoveryaims 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.