Discovering colored Petri nets from event logs

被引:27
|
作者
Rozinat A. [1 ]
Mans R.S. [1 ]
Song M. [1 ]
van der Aalst W.M.P. [1 ]
机构
[1] Eindhoven University of Technology, 5600 MB Eindhoven
关键词
Business Process; Process Instance; Throughput Time; ProM Framework; Decision Mining;
D O I
10.1007/s10009-007-0051-0
中图分类号
学科分类号
摘要
Process-aware information systems typically log events (e.g., in transaction logs or audit trails) related to the actual execution of business processes. Analysis of these execution logs may reveal important knowledge that can help organizations to improve the quality of their services. Starting from a process model, which can be discovered by conventional process mining algorithms, we analyze how data attributes influence the choices made in the process based on past process executions using decision mining, also referred to as decision point analysis. In this paper we describe how the resulting model (including the discovered data dependencies) can be represented as a Colored Petri Net (CPN), and how further perspectives, such as the performance and organizational perspective, can be incorporated. We also present a CPN Tools Export plug-in implemented within the ProM framework. Using this plug-in, simulation models in ProM obtained via a combination of various process mining techniques can be exported to CPN Tools. We believe that the combination of automatic discovery of process models using ProM and the simulation capabilities of CPN Tools offers an innovative way to improve business processes. The discovered process model describes reality better than most hand-crafted simulation models. Moreover, the simulation models are constructed in such a way that it is easy to explore various redesigns. © Springer-Verlag 2007.
引用
收藏
页码:57 / 74
页数:17
相关论文
共 50 条
  • [41] TOWARDS A MODULAR ANALYSIS OF COLORED PETRI NETS
    CHRISTENSEN, S
    PETRUCCI, L
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 113 - 133
  • [42] COLORED PETRI NETS AND THE INVARIANT-METHOD
    JENSEN, K
    [J]. THEORETICAL COMPUTER SCIENCE, 1981, 14 (03) : 317 - 336
  • [43] Switched LAN simulation by colored Petri nets
    Zaitsev, DA
    [J]. MATHEMATICS AND COMPUTERS IN SIMULATION, 2004, 65 (03) : 245 - 249
  • [44] MODELING CONCURRENT PROGRAMS WITH COLORED PETRI NETS
    STANSIFER, R
    BEAVEN, M
    MARINESCU, DC
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 1994, 26 (02) : 129 - 148
  • [45] MATRIX SPECIFICATION AND ANALYSIS OF COLORED PETRI NETS
    BELIKOV, VK
    RUTNER, YF
    [J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1988, 26 (03): : 77 - 80
  • [46] ML AND COLORED PETRI NETS FOR MODELING AND SIMULATION
    VARHOL, PD
    [J]. DR DOBBS JOURNAL, 1991, 16 (09): : 76 - &
  • [47] Switched LAN simulation by colored Petri nets
    Zaitsev, DA
    [J]. MODELLING AND SIMULATION 2003, 2003, : 485 - 488
  • [48] Modeling workflow processes with colored Petri nets
    Liu, DS
    Wang, JM
    Chan, SCF
    Sun, JG
    Zhang, L
    [J]. COMPUTERS IN INDUSTRY, 2002, 49 (03) : 267 - 281
  • [49] AN EFFICIENT METHOD FOR UNFOLDING COLORED PETRI NETS
    Liu, Fei
    Heiner, Monika
    Yang, Ming
    [J]. 2012 WINTER SIMULATION CONFERENCE (WSC), 2012,
  • [50] Methods for Efficient Unfolding of Colored Petri Nets
    Bilgram, Alexander
    Jensen, Peter G.
    Pedersen, Thomas
    Srba, Jiri
    Taankvist, Peter H.
    [J]. FUNDAMENTA INFORMATICAE, 2022, 189 (3-4) : 297 - 320