Monotonicity Schunselaar, Verbeek, Van der Aalst, Reijers

Motivation 2

Analysing the models (Petra) 3 Petra

Analysing the models (Petra) 4 Petra 1 2 3

Configurable process model 5

6

Analysing the models (Petra) 7 Petra 1 2 3

Pareto front 8 - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr of control tasks

Pareto front a closer look 9 - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr of control tasks

Pareto front a closer look 10 - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr of control tasks Processing time

Analysing the models (Petra) 11 Petra 1 2 3

General statement 12

Overview 13 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Overview 14 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

M’ M Processing Time The amount of time spent by resources on a case

Processing Time Is and ? Is faster than ?

Processing Time What about and ?

Processing Time What about 1.C?

Overview 19 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Processing Time (choices) Does imply ? ’

Overview 21 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Throughput Time The time it takes a case to move from start to finish

Throughput Time Is and ? Is faster than ? Is at least available when is available? Do we have at least as much as ?

Overview 24 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Throughput Time Is the relation between 3.B and 3.C and the relation between 1.B and 1.C ?

Overview 26 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Nr of control tasks working on a case Which are the control tasks?

Overview 28 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Mickey Mouse Index Mapping (activities, resources) Comparator (activities, resources) Partial order on relation (operator) between activities Occurrence of activities (resources) Classification of activities/resources Unmapped activities/resources 29

Overview 30 1 Processing time 2 Throughput time 3 Nr. of control tasks 4 Mickey Mouse Index 12 34

Remember: Pareto front 31 - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr. of control tasks - Throughput time - Processing time - Nr of control tasks - Throughput time - Processing time - Nr of control tasks Processing time

Remember: Pareto front 32 - Throughput time - Processing time - Nr. of control tasks - Mickey Mouse Index - Throughput time - Processing time - Nr of control tasks - Mickey Mouse Index - Throughput time - Processing time - Nr. of control tasks - Mickey Mouse Index - Throughput time - Processing time - Nr of control tasks - Mickey Mouse Index - Throughput time - Processing time - Nr of control tasks - Mickey Mouse Index Processing time

Analysing the models (Petra) 33 Petra 1 2 3

Future work Implementation + case study Effectiveness Increase in speed Proper support for loops Navigating through the analysed models Configuration constraints Language based/ the “O-word” 34

Questions 35