1 / 36

Jorge Muñoz -Gama

Algorithms for Process Conformance and Process Refinement. Jorge Muñoz -Gama. Universitat Politècnica de Catalunya (Barcelona , Spain). Outline. Process Mining , Conformance and Refinement Process Conformance Related Work and Motivation Approach Implementation and Results

fausta
Download Presentation

Jorge Muñoz -Gama

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Algorithms for Process Conformance and Process Refinement Jorge Muñoz-Gama UniversitatPolitècnica de Catalunya (Barcelona, Spain)

  2. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  3. Process Mining * www.processmining.org Process Conformance and Refinement

  4. Process Conformance and Refinement Locate the inconsistencies Petri Net • Refinement • Conformance • (Precision) B A D B C D A MDT C ETC Precision Metric Refined Model A B D A C D More accurate model Measure the inconsistencies Event Log Process Conformance and Refinement

  5. Conformance Dimensions How much of the observed behavior is captured by the model Models with minimal behavior to represent accurately the log Overly precise models which overfit the log Minimal structure which clearly reflect the behavior Process Conformance and Refinement

  6. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  7. Related Work • Precision in the literature • Most related work Rozinat et al. Information System 33 (2008) • Metric for Precision in Petri Nets • Computation of Follows and Precedes relations (Always, Never, Sometimes) of Model and Log. • Measurement based on discrepancies in Sometimes relations • Model relations require a model space state exploration Coverability Graph Process Conformance and Refinement

  8. Other Approaches and Motivation • Other approaches as language equivalence or bisimilarity are not suitable for Process Conformance • The complete models behavior is required • Goals and Requirements • Precision Dimension • Petri Nets • Avoid the complete state space exploration • Effort needed to obtain an accurate model • Fine-level precision • Locate the precision inconsistencies Process Conformance and Refinement

  9. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  10. General Idea: Escaping Edges Model Behavior Escaping Edges Log Behavior Model Behavior Process Conformance and Refinement

  11. Conformance Route Map Petri Net B A D C MDT Model States Traversal Metric Log States A B D A C D Event Log Process Conformance and Refinement

  12. Log and Model States • Log • Incorporate state information in the log • (Aalst et al. Software and Systems Modeling, 2009) • Past, Unlimited and Sequence • Model • Markings of the Petri Net Process Conformance and Refinement

  13. Model States and Mapping • Not all the reachable markings (could be infinite) • Only Markings with a Log State mapped on • Log and Model States Mapping • i.e., reached marking after replay state prefix p2 p3 p4 p1 p1 p2 p3 p4 p5 B A B E s2 s1 0 1 0 0 1 … 0 1 0 0 n s3 s4 E A C p5 D Markings not explored p1 p4 p3 p2 Process Conformance and Refinement

  14. Traversal • Log-guided Traversal of Model Behavior • Allowed Tasks : • i.e., actions enabled in that moment • Reflected Tasks : • i.e., actions really executed (thus, annotated in the log) B C D <p2> p2 p3 p4 p1 A B E A C E B B B C p2 p3 p4 p1 E E A A C C A B E A C E D D Process Conformance and Refinement

  15. Traversal (2) • Escaping Edges : • i.e., enabled actions not executed • Precision discrepancies B C D B p1 p2 p3 p4 E A C B C D A B E A C E D Process Conformance and Refinement

  16. Precision Metric • Take into account the Escaping Edges • Between 0 (imprecise) and 1 (precise) • More frequent traces, more weight in the metric • Independent of Structural dimension • Globally precision • Localizability A H I Z A P Q Z H I A Z P Q Process Conformance and Refinement

  17. Minimal Disconformant Traces (MDT) • Localizability of precision inconsistencies • i.e., Minimal traces indicating where the model starts to deviate from the log • Algorithm to compute all MDT using Escaping Edges B D A C MDT A E A B E C D P Q Refined Petri Net Process Conformance and Refinement

  18. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  19. Implementation • ProM 6 Framework • ETConformance Plug-In Process Conformance and Refinement

  20. Results Process Conformance and Refinement

  21. Results (2) Process Conformance and Refinement

  22. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  23. Invisible Tasks • Enabled Tasks? • C ? • B and C ? (Transitions associated with no event) p3 A B A A C p4 • Which Marking? • <p4> ? • <p3,p4> ? ... A C ... • INDETERMINISM Process Conformance and Refinement

  24. Invisible Tasks (2) • Invisible Coverability Graph • Solutions • Union of Enabled • Lazy Invisibles * • One path only • Shortest Invisible Path * A,B A B <1, 0, 0> Inv2 Inv1 <1, ω, 0> <0, 0, 1> C C Inv3 A,D X D <0, ω, 1> A,C X X *Rozinat et al. Information System 33 (2008) Process Conformance and Refinement

  25. Duplicate Tasks (Several Transitions associated with the same event) • Which Task? • B ? • B ? • INDETERMINISM • Solutions • e.g. Look-ahead B C A B D ... A B C ... Process Conformance and Refinement

  26. Variant: States as Markings • States as Prefix 2 Escaping Edges B C B A C A B C • States as Markings B A B C A C NO Escaping Edges p1 p2 p3 <p1> <p2> <p3> Process Conformance and Refinement

  27. Variant: Non fitting models • Symmetric to the Escaping Edges (Ee) • Log Escaping Edges (LEe): The points where the log deviates from the model • Fitness instead of Precision Model Behavior Escaping Edges Log Behavior Log Escaping Behavior Model Behavior Process Conformance and Refinement

  28. Outline • Process Mining , Conformance and Refinement • Process Conformance • Related Work and Motivation • Approach • Implementation and Results • Extensions • Process Refinement • Breaking Concurrencies • Supervisory Control Refinement • Future Work and Conclusions Process Conformance and Refinement

  29. Future Work: Refinement • Refinement can be performed by a Domain Expert B A D C MDT A E A B E B H J G Refined Petri Net Event Log B A E A B E D A Petri Net C Process Conformance and Refinement

  30. Breaking Concurrencies • Many causes for precision inconsistencies • Common one is Concurrency • Concurrency in the model allowing several possibilities • But not in the log • Idea is to break the concurrency introducing a new place • We need concurrency relations of the Petri net, the log, and check the results of the new model Process Conformance and Refinement

  31. Breaking Concurrencies: Petri net • Concurrency: it exists a reachable marking that enables both transitions, and firing one does not disable the other. • Problematic for large nets • Structural Concurrency • Best effort overapproximation for general Petri Nets • Exact for live and bounded Free Choice systems • Polynomial Algorithm • Kovalyov and Esparza , Proc. Intl. Workshop on Discrete Event Sytems, 1996 B D A C Process Conformance and Refinement

  32. Breaking Concurrencies: Log • Not concurrencies but the absence of them • Firing Causality Matrix: • Firing Causality: A B C D 0 Process Conformance and Refinement

  33. Breaking Concurrencies • Break the model concurrency with a place B D A A B C D C Process Conformance and Refinement

  34. Supervisory Control • Supervisory Control in Process Mining • Santos et al. Supervisory Control Service (2010) Refined Model MDT Abstraction MDT Supervisor Model Process Conformance and Refinement

  35. Conclusions and Future Work • New technique for precision between Petri nets and Log. • Avoids models state space exploration. • MDT, indicating the points where the model starts to deviates from the log. • Approach implemented as plug-in of ProM 6. • Breaking concurrencies to improve the precision. • Supervisory Control for precision refinement. Process Conformance and Refinement

  36. Thank You Papers: A fresh look at Precision in Process Conformance Jorge Muñoz-Gama and Josep Carmona Business Process Management (BPM) 2010 Thank You for Your Attention Process Conformance and Refinement

More Related