1 / 24

Decomposing Replay Problems: A Case Study

Decomposing Replay Problems: A Case Study. Eric Verbeek and Wil van der Aalst. Replay. In. Out. Alignments Transition sequence Activity Synchronous Net only Silent transition Trace Activity Synchronous Log only Minimal costs. Event log Traces Events Activity Petri net

tieve
Download Presentation

Decomposing Replay Problems: A Case Study

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. Decomposing Replay Problems:A Case Study Eric Verbeek and Wil van der Aalst

  2. Replay In Out Alignments Transition sequence Activity Synchronous Net only Silent transition Trace Activity Synchronous Log only Minimal costs • Event log • Traces • Events • Activity • Petri net • Labeled transitions • Activity • Initial marking • Final markings • Cost structure

  3. Decomposition using Passages

  4. Decomposed Replay • Decompose Petri net into subnets • Using passages (subsuming activities) • Adapt cost structure • Decompose Event log into sublogs • Empty traces! • Replay every sublog on corresponding subnet • Idea: Replaying sublogs on subnets is more efficient than replaying event log on Petri net • Can easily be done on multiple cores • Merge replay results • Aggregate costs • Sum

  5. Case Study – Settings – Petri nets

  6. Case Study – Settings – Event logs

  7. Case Study – Settings – Replay results

  8. Case Study –Decomp. Replay Results

  9. Bpic2012

  10. Bpic2012 – Problematic Passage

  11. BPIC2012 – Attempt 1

  12. BPIC2012 – Attempt 2

  13. BPIC2012 – Attempt 3a

  14. Case Study – Attempt 3a – Results

  15. BPIC2012 – Attempt 3b

  16. Case Study – Attempt 3b – Results

  17. BPIC2012 – Attempt 3c

  18. BPIC2012 – Attempt 3c - Milestones

  19. Wrapping Up

  20. Take-Home Points • Decomposed Replay can be faster • At acceptable costs • Decomposed Replay can be slower, much slower • What are good passages? • Given the replayer we’re using • Chaining passages seems to help • Sparsest cuts through the net?

  21. Bpic2012 – Attempt 1

  22. Bpic2012 – Attempt 2

  23. Bpic2012 – Attempt 3c A B C D

  24. Tool Implementation – ProM 6

More Related