Discovering an S-Coverable WF-net using DiSCover

H.M.W. (Eric) Verbeek

doi:10.1109/ICPM57379.2022.9980723

Discovering an S-Coverable WF-net using DiSCover

H.M.W. (Eric) Verbeek

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

Abstract

Although many algorithms exist that can discover a WF-net from an event log, only a few (if any at all) can discover advanced routing constructs. As examples, the Inductive miner uses process trees and cannot discover complex loops,
or situations where choice and parallel behavior is mixed, and the Hybrid ILP miner cannot discover certain complex routing constructs because it cannot discover silent transitions. This paper introduces the DiSCover miner, a discovery algorithm that can discover these more complex constructs and that is implemented in ProM. The DiSCover miner discovers from the event log a WF-net that corresponds to a collection of state machines that need to synchronize on the visible transitions (that is, on the activities from the event log). As such, it discovers a WF-net that is S-Coverable but not necessarily sound. Initial results show that it can discover complex routing constructs and that it performs well on the data sets of the different Process Discovery Contests. It even preformed better than winners of the 2020 and 2021 contests.

Original language	English
Title of host publication	2022 4th International Conference on Process Mining, ICPM 2022
Editors	Andrea Burattin, Artem Polyvyanyy, Barbara Weber
Publisher	Institute of Electrical and Electronics Engineers
Pages	64-71
Number of pages	8
ISBN (Electronic)	979-8-3503-9714-7
DOIs	https://doi.org/10.1109/ICPM57379.2022.9980723
Publication status	Published - 14 Dec 2022
Event	4th International Conference on Process Mining, ICPM 2022 - Bolzano, Italy Duration: 23 Oct 2022 → 28 Oct 2022 Conference number: 4

Conference

Conference	4th International Conference on Process Mining, ICPM 2022
Abbreviated title	ICPM 2022
Country/Territory	Italy
City	Bolzano
Period	23/10/22 → 28/10/22

Keywords

Event log
Discovery
S-coverable
WF-net
ProM
Process discovery contest
discovery
event log
Process Discovery Contest

Access to Document

10.1109/ICPM57379.2022.9980723

https://icpmconference.org/2022/wp-content/uploads/sites/7/2022/10/paper_56.pdf

Cite this

@inproceedings{19c3a5845d204cee89955dae8d17977a,

title = "Discovering an S-Coverable WF-net using DiSCover",

abstract = "Although many algorithms exist that can discover a WF-net from an event log, only a few (if any at all) can discover advanced routing constructs. As examples, the Inductive miner uses process trees and cannot discover complex loops, or situations where choice and parallel behavior is mixed, and the Hybrid ILP miner cannot discover certain complex routing constructs because it cannot discover silent transitions. This paper introduces the DiSCover miner, a discovery algorithm that can discover these more complex constructs and that is implemented in ProM. The DiSCover miner discovers from the event log a WF-net that corresponds to a collection of state machines that need to synchronize on the visible transitions (that is, on the activities from the event log). As such, it discovers a WF-net that is S-Coverable but not necessarily sound. Initial results show that it can discover complex routing constructs and that it performs well on the data sets of the different Process Discovery Contests. It even preformed better than winners of the 2020 and 2021 contests.",

keywords = "Event log, Discovery, S-coverable, WF-net, ProM, Process discovery contest, discovery, event log, Process Discovery Contest",

author = "Verbeek, \{H.M.W. (Eric)\}",

year = "2022",

month = dec,

day = "14",

doi = "10.1109/ICPM57379.2022.9980723",

language = "English",

pages = "64--71",

editor = "Andrea Burattin and Artem Polyvyanyy and Barbara Weber",

booktitle = "2022 4th International Conference on Process Mining, ICPM 2022",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "4th International Conference on Process Mining, ICPM 2022, ICPM 2022 ; Conference date: 23-10-2022 Through 28-10-2022",

}

Verbeek, HMW 2022, Discovering an S-Coverable WF-net using DiSCover. in A Burattin, A Polyvyanyy & B Weber (eds), 2022 4th International Conference on Process Mining, ICPM 2022., 9980723, Institute of Electrical and Electronics Engineers, pp. 64-71, 4th International Conference on Process Mining, ICPM 2022, Bolzano, Italy, 23/10/22. https://doi.org/10.1109/ICPM57379.2022.9980723

Discovering an S-Coverable WF-net using DiSCover. / Verbeek, H.M.W. (Eric).
2022 4th International Conference on Process Mining, ICPM 2022. ed. / Andrea Burattin; Artem Polyvyanyy; Barbara Weber. Institute of Electrical and Electronics Engineers, 2022. p. 64-71 9980723.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Discovering an S-Coverable WF-net using DiSCover

AU - Verbeek, H.M.W. (Eric)

N1 - Conference code: 4

PY - 2022/12/14

Y1 - 2022/12/14

N2 - Although many algorithms exist that can discover a WF-net from an event log, only a few (if any at all) can discover advanced routing constructs. As examples, the Inductive miner uses process trees and cannot discover complex loops, or situations where choice and parallel behavior is mixed, and the Hybrid ILP miner cannot discover certain complex routing constructs because it cannot discover silent transitions. This paper introduces the DiSCover miner, a discovery algorithm that can discover these more complex constructs and that is implemented in ProM. The DiSCover miner discovers from the event log a WF-net that corresponds to a collection of state machines that need to synchronize on the visible transitions (that is, on the activities from the event log). As such, it discovers a WF-net that is S-Coverable but not necessarily sound. Initial results show that it can discover complex routing constructs and that it performs well on the data sets of the different Process Discovery Contests. It even preformed better than winners of the 2020 and 2021 contests.

AB - Although many algorithms exist that can discover a WF-net from an event log, only a few (if any at all) can discover advanced routing constructs. As examples, the Inductive miner uses process trees and cannot discover complex loops, or situations where choice and parallel behavior is mixed, and the Hybrid ILP miner cannot discover certain complex routing constructs because it cannot discover silent transitions. This paper introduces the DiSCover miner, a discovery algorithm that can discover these more complex constructs and that is implemented in ProM. The DiSCover miner discovers from the event log a WF-net that corresponds to a collection of state machines that need to synchronize on the visible transitions (that is, on the activities from the event log). As such, it discovers a WF-net that is S-Coverable but not necessarily sound. Initial results show that it can discover complex routing constructs and that it performs well on the data sets of the different Process Discovery Contests. It even preformed better than winners of the 2020 and 2021 contests.

KW - Event log

KW - Discovery

KW - S-coverable

KW - WF-net

KW - ProM

KW - Process discovery contest

KW - discovery

KW - event log

KW - Process Discovery Contest

UR - https://www.scopus.com/pages/publications/85145783629

U2 - 10.1109/ICPM57379.2022.9980723

DO - 10.1109/ICPM57379.2022.9980723

M3 - Conference contribution

SP - 64

EP - 71

BT - 2022 4th International Conference on Process Mining, ICPM 2022

A2 - Burattin, Andrea

A2 - Polyvyanyy, Artem

A2 - Weber, Barbara

PB - Institute of Electrical and Electronics Engineers

T2 - 4th International Conference on Process Mining, ICPM 2022

Y2 - 23 October 2022 through 28 October 2022

ER -

Discovering an S-Coverable WF-net using DiSCover

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this