Improving efficiency for discovering business processes containing invisible tasks in non-free choice

Journal of Big Data

Table 1 Algorithms of process discovery

Algorithms	Types of relations
Algorithms	Sequence	Looping	XOR, AND	OR	Invisible prime task (Skip, Redo, Switch)	Non-free choice	Invisible task in non-free choice
$\alpha$ [17]	√		√
$\alpha ^{ + }$ [18]	√	√	√
$\alpha ^{{ + + }}$ [14]	√	√	√			√
$\alpha ^{\# }$ [19]	√	√	√		√
$\alpha ^{\$ }$ [4]	√	√	√		√	√	√
Heuristic miner [8]	√	√	√
Fodina [11]	√	√	√		√
HMM-parallel tasks [20]	√	√	√	√
CHMM-invisible tasks [21]	√	√	√	√	√
Graph-based parallel [15]	√	√	√	√
Graph-based invisible task [22]	√	√	√	√	√
Inductive miner [9]	√	√	√	√
RPST [10]	√	√	√