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

▶
automated repair of process models using non local
SMART_READER_LITE
LIVE PREVIEW

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

Jan 14, 2023 267 likes •497 views

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

slide-1
SLIDE 1

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

slide-2
SLIDE 2

Process m ining

2

a a a a a a b b b b b b b b c c c c c c c d d d d d d d d d e e e e e e e e a b b a a b c Process-Aware Information Systems

a b c d f e

Discovery Conformance checking Enhancement

  • Discovery
  • Conformance checking
  • Enhancement

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Event log

slide-3
SLIDE 3

Process m ining

3

a a a a a a b b b b b b b b c c c c c c c d d d d d d d d d e e e e e e e e a b b a a b c Process-Aware Information Systems

a b c d f e

Discovery Conformance checking Enhancement

  • Discovery
  • Conformance checking
  • Enhancement

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Event log

slide-4
SLIDE 4
  • 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

4

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-5
SLIDE 5
  • Discovery. Directly-Follows Graphs

(DFGs)

5

send application check application create application complete application notify client accept 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 | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-6
SLIDE 6
  • Discovery. Directly-Follows Graphs

(DFGs)

6

send application check application create application complete application notify client accept application

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

At each state of the system the choice is free and does depend on the previous history.

send application create application check application notify client complete application accept application

slide-7
SLIDE 7
  • Discovery. Directly-Follows Graphs

(DFGs)

7

send application check application create application complete application notify client accept application

Two additional traces:

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa send application create application check application notify client complete application accept application

slide-8
SLIDE 8
  • Discovery. Directly-Follows Graphs

(DFGs)

8

send application check application create application complete application notify client accept application

Some non-local dependencies may be lost.

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa send application create application check application notify client complete application accept application

slide-9
SLIDE 9

Process m ining

9

a a a a a a b b b b b b b b c c c c c c c d d d d d d d d d e e e e e e e e a b b a a b c Process-Aware Information Systems

a b c d f e

Discovery Conformance checking Enhancement

  • Discovery
  • Conformance checking
  • Enhancement
  • Repair

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

Event log

slide-10
SLIDE 10

False Free-Choice Relation

10

send application create application check application notify client complete application accept application

send application create application notify client complete application accept application

s1 s2 s4

check application

r1

check application

s3 s5 r3 s6 s7

Transition system that encodes event log L Discovered process model

The local choice may depend on the process history

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-11
SLIDE 11

Repair Using Non-Local Constraints

11

Event log Free-choice process model Non-local constraints Process model with non-local constraints

send application create application check application notify client complete application accept application send application create application check application notify client complete application accept application

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-12
SLIDE 12

State-based Region Synthesis

12 send application create application notify client complete application accept application

s1 s6 s7 r2 s2 s4

check application

r1

check application

s3 s5 r3 r4 r5 r6 r7

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-13
SLIDE 13

State-based Region Synthesis

13

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

send application create application check application notify client complete application accept application r1 r2 r3 r4 r6 r5 r7

slide-14
SLIDE 14

14

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis

slide-15
SLIDE 15

15

send application create application notify client complete application accept application

s1 s6 s7 r2 s2 s4

check application

r1

check application

s3 s5 r3 r4 r5 r6 r7

ESSP(s4, “complete application”)? ESSP(s5, “notify client”)?

send application create application check application notify client complete application accept application

False free-choice relation

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis

slide-16
SLIDE 16

16

send application create application notify client complete application accept application

s1 s6 s7 r2 s2 s4

check application

r1

check application

s3 s5 r3 r4 r5 r6 r7

ESSP(s4, “complete application”)? ESSP(s5, “notify client”)?

False free-choice relation

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

State-based Region Synthesis

send application create application check application notify client complete application accept application r1 r2 r3 r4 r6 r5 r7

slide-17
SLIDE 17

Form al Properties of Repair Algorithm

17

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-18
SLIDE 18

Evaluation

18 a b c d e f g h i j k l m

The plugin is open-source and was implemented in Apromore Community Edition

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

0.82 0.84 0.86 0.88 0.9 0.92 0.94 0.96 0.98 1 1.02 5 10 15 20

Number of places Precision

slide-19
SLIDE 19

Evaluation

19

Validating Returned Accepted Incomplete Pending Complete Validating Returned Accepted Incomplete Pending Complete r1 r2

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-20
SLIDE 20

BPMN (Business Process Model and Notation)

20

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-21
SLIDE 21

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.

21

41st International Conference on Application and Theory of Petri Nets and Concurrency | Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa

slide-22
SLIDE 22

Thank you