Bpm10slides

199 views

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
199
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Bpm10slides

  1. 1. A fresh look at Precision in Process Conformance<br />Jorge Muñoz-GamaJosep Carmona<br />UniversitatPolitècnica de Catalunya<br />(Barcelona, Spain)<br />
  2. 2. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />2<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  3. 3. Process Mining<br />15 Sep 2010<br />Precision in Process Conformance<br />3<br />* www.processmining.org<br />
  4. 4. Conformance Dimensions<br />15 Sep 2010<br />Precision in Process Conformance<br />4<br />How much of the observed behavior is captured by the model<br />Models with minimal behavior to represent accurately the log<br />Overly precise models which overfit the log<br />Minimal structure which clearly reflect the behavior<br />
  5. 5. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />5<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  6. 6. Related Work<br />15 Sep 2010<br />Precision in Process Conformance<br />6<br />Precision in the literature<br />Most related work Rozinat et al. Information System 33 (2008)<br />Metric for Precision in Petri Nets<br />Computation of Follows and Precedes relations (Always, Never, Sometimes) of Model and Log.<br />Measurement based on discrepancies in Sometimes relations<br />Model relations require a model space state exploration<br />Coverability<br />Graph<br />
  7. 7. Motivation<br />15 Sep 2010<br />Precision in Process Conformance<br />7<br />Goals and Requirements<br />Precision Dimension<br />Petri Nets<br />Avoid the complete state space exploration<br />Effort needed to obtain an accurate model<br />Fine-level precision<br />Locate the precision inconsistencies<br />
  8. 8. Process Conformance and Refinement<br />15 Sep 2010<br />Precision in Process Conformance<br />8<br />Locate the inconsistencies<br />Petri Net<br />Conformance<br />(Precision)<br />B<br />A<br />D<br />C<br />MDT<br />ETC Precision<br />Metric<br />A B D<br />A C D<br />Measure the inconsistencies<br />Event Log<br />
  9. 9. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />9<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  10. 10. General Idea: Escaping Edges<br />15 Sep 2010<br />Precision in Process Conformance<br />10<br />Model<br />Behavior<br />Escaping<br />Edges<br />Log<br />Behavior<br />Model<br />Behavior<br />
  11. 11. Conformance Route Map<br />15 Sep 2010<br />Precision in Process Conformance<br />11<br />Petri Net<br />B<br />A<br />D<br />C<br />MDT<br />Model<br />States<br />Traversal<br />Metric<br />Log<br />States<br />A B D<br />A C D<br />Event Log<br />
  12. 12. Log and Model States<br />15 Sep 2010<br />Precision in Process Conformance<br />12<br />Log <br />Incorporate state information in the log<br />(Aalst et al. Software and Systems Modeling, 2009)<br />Past, Unlimited and Sequence<br />Model<br />Markings of the Petri Net<br />
  13. 13. Model States and Mapping<br />15 Sep 2010<br />Precision in Process Conformance<br />13<br />Not all the reachable markings (could be infinite)<br />Only Markings with a Log State mapped on<br />Log and Model States Mapping<br />i.e., reached marking after replay state prefix <br />p2<br />p3<br />p4<br />p1<br />p1 p2 p3 p4 p5<br />B<br />A B E<br />s2<br />s1<br />s3<br />s4<br />0 1 0 0 1<br />…<br />0 1 0 0 n<br />E<br />A<br />C<br />p5<br />D<br />Markings not explored<br />p1<br />p4<br />p3<br />p2<br />
  14. 14. Log-guided Traversal<br />15 Sep 2010<br />Precision in Process Conformance<br />14<br />Log-guided Traversal of Model Behavior<br />Allowed Tasks : <br />i.e., actions enabled in that moment<br />Reflected Tasks : <br />i.e., actions really executed (thus, annotated in the log) <br />B<br />C<br />D<br /><p2><br />p2<br />p3<br />p4<br />p1<br />A B E<br />A C E<br />B<br />B<br />B<br />C<br />p2<br />p3<br />p4<br />p1<br />E<br />E<br />A<br />C<br />A<br />C<br />A B E<br />A C E<br />D<br />D<br />
  15. 15. Traversal (2)<br />15 Sep 2010<br />Precision in Process Conformance<br />15<br />Escaping Edges : <br />i.e., enabled actions not executed<br />Precision discrepancies<br />B<br />C<br />D<br />B<br />p1<br />p2<br />p3<br />p4<br />E<br />A<br />C<br />B<br />C<br />D<br />A B E<br />A C E<br />D<br />
  16. 16. Precision Metric<br />15 Sep 2010<br />Precision in Process Conformance<br />16<br />Take into account the Escaping Edges<br />Between 0 (imprecise) and 1 (precise)<br />More frequent traces, more weight in the metric<br />Independent of Structural dimension<br />Global precision<br />Localizability<br />A H I Z<br />A P Q Z<br />H<br />I<br />A<br />Z<br />P<br />Q<br />
  17. 17. Minimal Disconformant Traces (MDT)<br />15 Sep 2010<br />Precision in Process Conformance<br />17<br />Localizability of precision inconsistencies<br />i.e., Minimal traces indicating where the model starts to deviate from the log<br />Algorithm to compute all MDT using Escaping Edges <br />B<br />D<br />A<br />C<br />MDT<br />A E<br />A B E<br />C D P Q<br />Refined Petri Net<br />
  18. 18. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />18<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  19. 19. Implementation<br />15 Sep 2010<br />Precision in Process Conformance<br />19<br />ProM 6 Framework<br />ETConformance Plug-In<br />
  20. 20. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />20<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  21. 21. Results<br />15 Sep 2010<br />Precision in Process Conformance<br />21<br />
  22. 22. Results (2)<br />15 Sep 2010<br />Precision in Process Conformance<br />22<br />
  23. 23. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />23<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br /><ul><li>Invisible Tasks
  24. 24. Duplicate Tasks
  25. 25. States as Markings
  26. 26. Non fitting</li></ul>done<br />done<br />in progress<br />in progress<br />
  27. 27. Invisible Tasks<br />15 Sep 2010<br />Precision in Process Conformance<br />24<br />(Transitions associated with no event)<br />p3<br />I<br />B<br /><ul><li>Which Sequence?
  28. 28. A H C ?
  29. 29. A I C?</li></ul>A<br />H<br />C<br />p4<br /><ul><li>INDETERMINISM </li></ul>A C<br />
  30. 30. Invisible Tasks (2)<br />15 Sep 2010<br />Precision in Process Conformance<br />25<br />Invisible Coverability Graph<br />Solutions<br />Union of Enabled<br />Lazy Invisibles *<br />One path only<br />Shortest Invisible Path *<br />A,B<br />A<br />B<br /><1, 0, 0><br />Inv2<br />Inv1<br /><1, ω, 0><br /><0, 0, 1><br />C<br />C<br />Inv3<br />A,D<br />D<br />X<br /><0, ω, 1><br />A,C<br />X<br />X<br />*Rozinat et al.<br />Information System 33 (2008)<br />
  31. 31. Duplicate Tasks<br />15 Sep 2010<br />Precision in Process Conformance<br />26<br />(Several Transitions associated <br />with the same event)<br />Which Task?<br />B ?<br />B ?<br />INDETERMINISM<br />Solutions<br />e.g. Look-ahead<br />B<br />C<br />A<br />B<br />D<br />... A B C ...<br />
  32. 32. Variant: States as Markings<br />15 Sep 2010<br />Precision in Process Conformance<br />27<br />States as Prefix<br />2<br />Escaping Edges<br />B<br />C<br />B<br />A<br />C<br />A B C<br /><ul><li>States as Markings</li></ul>B<br />A B C<br />A<br />C<br />NO Escaping Edges<br />p1<br />p2<br />p3<br /><p1><br /><p2><br /><p3><br />
  33. 33. Variant: Non fitting models<br />15 Sep 2010<br />Precision in Process Conformance<br />28<br />Symmetric to the Escaping Edges (Ee)<br />Log Escaping Edges (LEe): The points where the log deviates from the model<br />Fitness instead of Precision<br />Model<br />Behavior<br />Escaping<br />Edges<br />Log<br />Behavior<br />Log<br />Escaping<br />Edges<br />Model<br />Behavior<br />
  34. 34. Outline<br />15 Sep 2010<br />Precision in Process Conformance<br />29<br />Process Mining and Process Conformance<br />Motivation<br />Approach<br />General Approach<br />Implementation<br />Results<br />Extensions<br />Future work<br />Conclusions<br />
  35. 35. Future Work: Refinement<br />15 Sep 2010<br />Precision in Process Conformance<br />30<br />B<br />A<br />D<br />C<br />MDT<br />A E<br />A B E<br />B H J G<br />Refined Petri Net<br />Event Log<br />B<br />A E<br />A B E<br />D<br />A<br />Petri Net<br />C<br />
  36. 36. Concurrencies in the model but not in the log<br />Break the model concurrency with a restriction, e.g. a place<br />Structural Concurrency<br />Best effort overapproximation for general Petri Nets<br />Exact for live and bounded Free Choice systems<br />Polynomial Algorithm <br />Kovalyov and Esparza , Proc. Intl. Workshop on Discrete Event Sytems, 1996<br />Future Work: Breaking Concurrencies<br />15 Sep 2010<br />Precision in Process Conformance<br />31<br />B<br />D<br />A<br />A B C D<br />C<br />
  37. 37. Supervisory Control<br />15 Sep 2010<br />Precision in Process Conformance<br />32<br />Refined <br />Model<br />MDT <br />Abstraction<br />MDT<br />Supervisor<br />Model<br />Supervisory Control in Process Mining<br />Santos et al. Supervisory Control Service (2010)<br />
  38. 38. Conclusions<br />15 Sep 2010<br />Precision in Process Conformance<br />33<br />New technique for precision between Petri nets and Log.<br />Avoids complete models state space exploration.<br />Metric based on the effort needed to obtain a precise model.<br />MDT, indicating the points where the model starts to deviates from the log.<br />Approach implemented as plug-in of ProM 6.<br />
  39. 39. Thank You<br />15 Sep 2010<br />Precision in Process Conformance<br />34<br />Thank You for Your Attention<br />

×