Process discovery using integer linear programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

171 Citations (Scopus)
1 Downloads (Pure)

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 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.
Original languageEnglish
Title of host publicationApplications and Theory of Petri Nets (29th International Conference, Petri Nets 2008, Xi'an, China, June 23-27, 2008, Proceedings)
EditorsK.M. Hee, van, R. Valk
Place of PublicationBerlin
PublisherSpringer
Pages368-387
ISBN (Print)978-3-540-68745-0
DOIs
Publication statusPublished - 2008

Publication series

NameLecture Notes in Computer Science
Volume5062
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Process discovery using integer linear programming'. Together they form a unique fingerprint.

Cite this