Process Discovery using Integer Linear Programming

被引：87

作者：

van der Werf, J. M. E. M. ^{[1
]}

van Dongen, B. F. ^{[1
]}

Hurkens, C. A. J. ^{[1
]}

Serebrenik, A. ^{[1
]}

机构：

[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

来源：

FUNDAMENTA INFORMATICAE | 2009年 / 94卷 / 3-4期

关键词：

PROCESS MODELS; PETRI NETS; REGIONS;

D O I：

10.3233/FI-2009-136

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：387 / 412

页数：26

共 29 条

[1]

[Anonymous], lp solve reference guide

[2]

Badouel E., 1998, Lectures on Petri Nets I: Basic Models. Advances in Petri Nets, P529

[3]

Badouel E, 1995, LECT NOTES COMPUT SC, V915, P364

[4]

BERGENTHUM R, 2006, ICATPN 2006

[5]

Bergenthum R, 2007, LECT NOTES COMPUT SC, V4714, P375

[6]

Carmona J, 2008, LECT NOTES COMPUT SC, V5240, P358, DOI 10.1007/978-3-540-85758-7_26

[7] Deriving Petri Nets from finite transition systems [J].

Cortadella, J ;

Kishinevsky, M ;

Lavagno, L ;

Yakovlev, A .

IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (08) :859-882

[8]

Darondeau P, 1998, LECT NOTES COMPUT SC, V1466, P533, DOI 10.1007/BFb0055646

[9]

Darondeau P, 2005, IEEE DECIS CONTR P, P2107

[10]

de Medeiros AKA, 2004, LECT NOTES COMPUT SC, V3272, P151

← 1 2 3 →