HIERARCHICAL CONFORMANCE CHECKING OF PROCESS MODELS BASED ON EVENT LOGS
Jorge Munoz-Gama, Josep Carmona and Wil M.P. van der Aalst
2
Session 7: Process Mining and Conformance
3
Process Mining in a Nutshell
THEORY REALITY
4
Process Mining in a Nutshell
THEORY REALITY
??REALITY REFLECTION
LOGS
5
Session 7: Process Mining and Conformance
6
Conformance in a NutshellLog Model
A B C D EA B B C
Alignment
E
Fitness Precision
How much behavior of the logis captured by the model?
How accurate is the modeldescribing the log?
7
Conformance in the Large• How easy is to diagnose a conformance problem here?• How much time it takes?
8
Process Diagnosis like a Map
9
Process Diagnosis like a Map
10
Decomposition Goals
• Intuitive and independent decomposition
• Hierarchy between components
SESE RPSTSingle EntrySingle Exitcomponents
Refined Process Structure Tree
* Artem Polyvyanyy: Structuring Process Models. PhD Thesis. University of Potsdam (Germany), January 2012
11
Structural Decomposition
12
Interior, Boundary, Entry, and Exit nodes
• Given a subgraph and a node of it:
• Interior node: connected only to nodes of the subgraph.
• Boundary node: not interior
• Entry node: boundary where • no incoming edge in subgraph • or all outgoing edges in
• Exit node: boundary where • no outgoing edge in subgraph • or all incoming edges in
13
Example of SESE and RPST
SESE: set of edges which graph has a Single Entry node and a Single Exit node
Refined Process Structure Tree (RPST) containing non overlapping SESEs
• Unique• Modular• Polynomial Time
14
Decomposed Conformance
• For each component in the RPST
• Project the Log
• Initial and Final marking of subnet
• Align projected log and subnet
• Compute fitness and precision<
t5 t6 t5t1 t2 t3 t3 t7
15
Conformance and Markings Dependency
• The conclusions are strongly dependent on the markings
A
B
C
A
B
C
D
E
16
Component inside a Cycle
X
Y
A B
B C DA
E
17
Depending Analysis• Test components in isolation
• Black Box• Multi-scenario responses
• Exploit properties• Safe, bounds, …• Acyclic• Subclass of Petri Net• Domain specific properties
18
Safe Sound Workflow Nets (1)• Entry/Exit Places
19
Safe Sound Workflow Nets (2)• Initial Marking = one token on the entry• Final Marking = one token on the exit
20
Safe Sound Workflow Nets (3)• Short-circuited the entry and exit with invisible transition
• Heuristic: all transitions of the component belong to T-invariants of the original net• Best effort but good empirical results
21
Implementation
ProM 6 (http://www.promtools.org)
22
Implementation
ProM 6 (http://www.promtools.org)
23
Results
• 1 Component – 1h 15min• 7 Components – 2min
24
Future Work
• Decomposed Conformance Checking Problem• Not hierarchy but partitioning• Reducing the time• Non depending results
Conformance Checking in the Large: Partitioning and Topology
J. Munoz-Gama, J. Carmona and W. van der AalstBusiness Process Management (BPM) 2013
25
Conclusions• Decomposition based on SESEs and RPST to aid on the
diagnosis of conformance problems
• Strong dependency between the context selected and the results obtained.
• Case of Safe Sound Workflow Nets
• Implemented in ProM 6
Thank You