Automated Repair of Process Models Using Non-Local Constraints - PowerPoint PPT Presentation

Automated Repair of Process Models Using Non-Local Constraints Anna Kalenkova*, Josep Carmona**, Artem Polyvyanyy*, Marcello La Rosa* * The University of Melbourne ** Polytechnic University of Catalonia 1

Process m ining Process-Aware Information Systems Event log Discovery • c e e d b c e d d e c d c Conformance checking e a • a b a Enhancement b e b e b a b d b c a d b c d Enhancement e a • a b c d a d b a b c Conformance b checking a c e d f Discovery 41st International Conference on Application and Theory of Petri Nets and Concurrency | 2 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Process m ining Process-Aware Information Systems Event log Discovery • c e e d b c e d d e c d c Conformance checking e a • a b a Enhancement b e b e b a b d b c a d b c d Enhancement e a • a b c d a d b a b c Conformance b checking a c e d f Discovery 41st International Conference on Application and Theory of Petri Nets and Concurrency | 3 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Discovery. Event log Case ID Activity name Timestamp 1 send application 2019-10-28T10:02:30 2 create application 2019-10-28T10:03:17 1 check application 2019-10-28T10:03:58 1 notify client 2019-10-28T10:04:20 1 accept application 2019-10-28T10:04:25 2 check application 2019-10-28T14:32:51 2 complete application 2019-10-29T09:45:13 2 accept application 2019-10-29T09:50:45 41st International Conference on Application and Theory of Petri Nets and Concurrency | 4 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Discovery. Directly-Follows Graphs (DFGs) send notify application client accept check application application complete create application application DFGs are used as a final process representation in commercial process mining tools. As well as an intermediate process representation within scalable process mining algorithms, e.g., Inductive miner and Split miner that discover free-choice nets such as BPMN models. 41st International Conference on Application and Theory of Petri Nets and Concurrency | 5 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Discovery. Directly-Follows Graphs (DFGs) send notify application client accept check application application complete create application application send application notify client check application accept application At each state of the system the choice is free and does depend on the previous history. create application complete application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 6 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Discovery. Directly-Follows Graphs (DFGs) send notify application client accept check application application complete create application application send application notify client check application accept application Two additional traces: create application complete application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 7 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Discovery. Directly-Follows Graphs (DFGs) send notify application client accept check application application complete create application application send application notify client check application accept application Some non-local dependencies may be lost. create application complete application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 8 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Process m ining Process-Aware Information Systems Event log Discovery • c e e d b c e d d e c d c Conformance checking e a • a b a Enhancement b e b e b a b d b c a d b c d Enhancement e a • a b c d a d b Repair • a b c Conformance b checking a c e d f Discovery 41st International Conference on Application and Theory of Petri Nets and Concurrency | 9 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

False Free-Choice Relation Discovered process model send application notify client check application accept application Transition system that encodes event log L create application complete application check s 2 s 4 application send application notify accept application client s 7 s 6 s 1 r 1 The local choice may depend on r 3 the process history complete create check application s 3 s 5 application application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 10 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Repair Using Non-Local Constraints Event log Free-choice process model send application notify client check application accept application create application complete application Process model with non-local constraints Non-local constraints send application notify client accept application check application create application complete application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 11 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis r 2 check s 2 s 4 application send notify application accept application client s 1 r 5 r 7 r 6 r 4 r 1 s 6 s 7 r 3 complete create application check s 3 s 5 application application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 12 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis r 2 send application notify client accept application check application r 6 r 7 r 4 r 1 r 5 r 3 create application complete application 41st International Conference on Application and Theory of Petri Nets and Concurrency | 13 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis 41st International Conference on Application and Theory of Petri Nets and Concurrency | 14 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis r 2 check s 2 s 4 send application notify client application send notify check application accept application application accept application client s 1 r 5 r 7 r 6 r 4 r 1 s 6 s 7 r 3 complete create application check s 3 s 5 create application complete application application application ESSP(s4, “complete application”)? ESSP(s5, “notify client”)? False free-choice relation 41st International Conference on Application and Theory of Petri Nets and Concurrency | 15 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis r 2 check r 2 s 2 s 4 send application notify client application send notify accept application application check application accept application client s 1 r 5 r 7 r 6 r 7 r 6 r 4 r 1 r 4 r 1 r 5 s 6 s 7 r 3 r 3 complete create application check s 3 s 5 create application complete application application application ESSP(s4, “complete application”)? ESSP(s5, “notify client”)? False free-choice relation 41st International Conference on Application and Theory of Petri Nets and Concurrency | 16 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Form al Properties of Repair Algorithm 41st International Conference on Application and Theory of Petri Nets and Concurrency | 17 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Evaluation 1.02 1 The plugin is open-source and was implemented 0.98 0.96 Number of places in Apromore Community Edition 0.94 0.92 0.9 0.88 0.86 0.84 0.82 0 5 10 15 20 Precision b d g a i k m h e c j l f 41st International Conference on Application and Theory of Petri Nets and Concurrency | 18 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Evaluation Accepted Pending Complete Validating Returned Incomplete Accepted Pending Complete Validating r 2 r 1 Returned Incomplete 41st International Conference on Application and Theory of Petri Nets and Concurrency | 19 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

BPMN (Business Process Model and Notation) 41st International Conference on Application and Theory of Petri Nets and Concurrency | 20 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Conclusion and Future work Although the Petri net synthesis problem is reduced (only some constraints are to be found), it still remains NP-complete. Thus, an extension of the proposed algorithm is to be advised to improve its performance characteristics. 41st International Conference on Application and Theory of Petri Nets and Concurrency | 21 Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Thank you