Process discovery:Inductive Miner

Sander LeemansD. Fahland

W.M.P van der Aalst

S.J.J. Leemans 2

Process discovery

system log process model

S.J.J. Leemans 3

Quality

Complete log

=

SoundSimple

System behaviour

FittingPrecise

Recorded log fast

4

Results with incomplete logs

ILPαHeuristics Miner Evolutionary Tree Miner

not fastnot fittingnot sound

not fittingnot sound

not simplenot sound

Flower modelnot precise

S.J.J. Leemans 5

Outline

=

{<a,b,c>, <a,c,b>, <a,d,e>, <a,d,e,f,d,e>}

System behaviour

Sander Leemans 6

Block-structured Petri nets

a b

c d

e

a

b

c d

e

S.J.J. Leemans 7

Outline

=

System behaviour

S.J.J. Leemans 8

Divide & conquer

{<a,b,c>, <a,c,b>, <a,d,e>, <a,d,e,f,d,e>}

{<a>, <a>, <a>, <a>}

{<b,c>, <c,b>, <d,e>, <d,e,f,d,e>}

recurserecurse

a

S.J.J. Leemans 9

Finding operator

{<a,b,c>, <a,c,b>, <a,d,e>, <a,d,e,f,d,e>}

{<b,c>, <c,b>, <d,e>, <d,e,f,d,e>}

recurse

ab

c

d e

f

a

• Find cut in directly-follows graph• Sequence: edges crossing one-

way only

S.J.J. Leemans 10

recurse …

xa

{<b,c>,<c,b>}

{<d,e>, <d,e,f,d,e>}

{d,e,f}{b,c}

<d,e><d,e,f,d,e>

{

}

<b,c><c,b>

,,,

{

{

,}

, }

{<b,c>, <c,b>, <d,e>, <d,e,f,d,e>}

d e

b

c

f

Exclusive choice: no crossing edges

S.J.J. Leemans 11

{<b,c>,<c,b>}

… one more recursion …

f

xa

ed

{<d,e>, <d,e,f,d,e>}

{<f>}{<d,e>}d,e d,e

{f}{d,e}

d,e, ,f

{< >,>}<

{<<<

>,>,>}

{< >}d e

f Loop: identify body and loopback parts(assumption: start/end activities disjoint)

S.J.J. Leemans 12

… last recursion

cb

x

f

a

ed

{<b,c>,<c,b>}

{<b>}{<c>}b

,,

{<<

{b} {c}

>,>}

b cc

{<<

>>}

{<<

>>}

b

c Parallel: all possible crossing edges

S.J.J. Leemans 13

Result

cb

x

f

a

ed

τ

a

τ τb

c

d e

f

τ

S.J.J. Leemans 14

No cut

x

cb

ay

z

x

xy z

Sander Leemans 15

Inductive Miner

• Divide activities• Select operator– Else: flower model

• Split log• Recurse on splitted logs

?

?

{c,d}{a,b}

{c} {d}

S.J.J. Leemans 16

Outline

=

System behaviour

S.J.J. Leemans 17

Rediscoverability

• Directly-follows graph complete

• Noise-free

= (language equivalent)

Complete log

System behaviour

= (normal form)

• Block-structured with • Start\end activities of loop

disjoint• No duplicate activities• No silent activities (τ)

x

S.J.J. Leemans 18

Incomplete logs

Complete log

System behaviour

Incomplete logpolynomial

FittingMost precise

SoundSimple

(by framework; bring your own operator)

S.J.J. Leemans 19

Future Work

Generalise– Block-structured

– Start\end activities of loop must be disjoint

– No duplicate activities– No silent activities (τ)

– Directly-follows graph complete

– Noise-freex

S.J.J. Leemans 20

You have been watching

Complete log

System behaviour

Incomplete logpolynomial

FittingMost precise

SoundSimple

(by framework; bring your own operator)