C ONFORMANCE C HECKING OF P ROCESSES B ASED ON M ONITORING R EAL B EHAVIOR Jason Ree 4/18/11 UNIST School of Technology Management.

Slides:



Advertisements
Similar presentations
Debugging ACL Scripts.
Advertisements

Testing Relational Database
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining Nikola Trčka Mykola Pechenizkiy.
Jorge Muñoz-Gama Josep Carmona
Ex Post Facto Experiment Design Ahmad Alnafoosi CSC 426 Week 6.
Confidence Intervals for Proportions
1-1 Copyright © 2015, 2010, 2007 Pearson Education, Inc. Chapter 18, Slide 1 Chapter 18 Confidence Intervals for Proportions.
Spin Tutorial (some verification options). Assertion is always executable and has no other effect on the state of the system than to change the local.
VALIDITY.
Software Testing and Quality Assurance
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #19 3/8/02 Taguchi’s Orthogonal Arrays.
Overview Sequential Circuit Design Specification Formulation
DAST 2005 Week 4 – Some Helpful Material Randomized Quick Sort & Lower bound & General remarks…
Copyright © 2010 Pearson Education, Inc. Chapter 19 Confidence Intervals for Proportions.
On Comparing Classifiers: Pitfalls to Avoid and Recommended Approach Published by Steven L. Salzberg Presented by Prakash Tilwani MACS 598 April 25 th.
Chapter 19: Confidence Intervals for Proportions
Chemometrics Method comparison
8/15/2015Slide 1 The only legitimate mathematical operation that we can use with a variable that we treat as categorical is to count the number of cases.
Middle School Liaison Meeting
Why Analysis Process Refer to earlier chapters Models what the system will do makes it easier for understanding no environment considered (hence, system.
Chapter 2 Data Handling.
程建群 博士(Dr. Jason Cheng) 年03月
Jorge Muñoz-Gama Universitat Politècnica de Catalunya (Barcelona, Spain) Algorithms for Process Conformance and Process Refinement.
Classroom Assessments Checklists, Rating Scales, and Rubrics
2-Oct-15 Bojan Orlic, TU/e Informatica, System Architecture and Networking 12-Oct-151 Homework assignment 1 feedback Bojan Orlic Architecture.
10.4 How to Find a Perfect Matching We have a condition for the existence of a perfect matching in a graph that is necessary and sufficient. Does this.
Compiler Construction Lexical Analysis. The word lexical means textual or verbal or literal. The lexical analysis implemented in the “SCANNER” module.
The Pumping Lemma for Context Free Grammars. Chomsky Normal Form Chomsky Normal Form (CNF) is a simple and useful form of a CFG Every rule of a CNF grammar.
Observation & Analysis. Observation Field Research In the fields of social science, psychology and medicine, amongst others, observational study is an.
1 Conditions Logical Expressions Selection Control Structures Chapter 5.
AIM: Significant Figures ► ► What are significant figures? ► On a blank sheet of paper Chapter Two 1.
Selection Control Structures. Simple Program Design, Fourth Edition Chapter 4 2 Objectives In this chapter you will be able to: Elaborate on the uses.
Conceptual Modelling – Behaviour
Developing an Algorithm
Multi Way Selection You can choose statement(s) to run from many sets of choices. There are two cases for this: (a)Multi way selection by nested IF structure.
Requirements Engineering Southern Methodist University CSE 7316 – Chapter 3.
Han-na Yang Rediscovering Workflow Models from Event-Based Data using Little Thumb.
Significant Figures When using calculators we must determine the correct answer. Calculators are ignorant boxes of switches and don’t know the correct.
Copyright © 2010 Pearson Education, Inc. Chapter 19 Confidence Intervals for Proportions.
Process-oriented System Analysis Process Mining. BPM Lifecycle.
Project quality management. Introduction Project quality management includes the process required to ensure that the project satisfies the needs for which.
1 Kyung Hee University Statecharts Spring Kyung Hee University Specifying Objects’ Behaviour  Interaction diagrams show message-passing behaviour.
Uncertainty Management in Rule-based Expert Systems
Copyright © 2009 Pearson Education, Inc. Chapter 19 Confidence Intervals for Proportions.
Copyright ©2004 Virtusa Corporation | CONFIDENTIAL Requirement Engineering Virtusa Training Group 2004 Trainer: Ojitha Kumanayaka Duration : 1 hour.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 19 Confidence Intervals for Proportions.
1 CEN 4020 Software Engineering PPT4: Requirement analysis.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 19 Confidence Intervals for Proportions.
Operational Semantics Mooly Sagiv Tel Aviv University Sunday Scrieber 8 Monday Schrieber.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
CHAPTER 15: Tests of Significance The Basics ESSENTIAL STATISTICS Second Edition David S. Moore, William I. Notz, and Michael A. Fligner Lecture Presentation.
Statistics 19 Confidence Intervals for Proportions.
Process Mining – Concepts and Algorithms Review of literature on process mining techniques for event log data.
Multi-phase Process Mining: Building Instance Graphs
Confidence Intervals for Proportions
Chapter 4: Business Process and Functional Modeling, continued
Advantages of FSM Their simplicity make it easy for inexperienced developers to implement with little to no extra knowledge (low entry level)
Unit 5: Hypothesis Testing
Confidence Intervals for Proportions
Introduction Defining the Problem as a State Space Search.
SAD ::: Spring 2018 Sabbir Muhammad Saleh
Chapter 1 Units and Problem Solving
Using Use Case Diagrams
Significance Tests: The Basics
Confidence Intervals for Proportions
Confidence Intervals for Proportions
CHAPTER 4 Designing Studies
Retrieval Performance Evaluation - Measures
A handbook on validation methodology. Metrics.
Presentation transcript:

C ONFORMANCE C HECKING OF P ROCESSES B ASED ON M ONITORING R EAL B EHAVIOR Jason Ree 4/18/11 UNIST School of Technology Management

I NTRODUCTION – C ONFORMANCE C HECKING Conformance checking “Is there a match between the recorded events and the model?” Concerned with the comparison of an existing process model and a corresponding log Petri nets (or any modeling language that can be equipped with executable semantics)

T WO P ERSPECTIVES OF A C ONFORMANCE P ROBLEM 1. The model may be assumed to be “correct” because it represents the way the business process should be carried out 2. The event log may be assumed to be “correct” because it is what really happened, and the process model might be either outdated or just not tailored to the needs of the employees actually performing the tasks

M EASUREMENT – T WO D IMENSIONS OF C ONFORMANCE 1. Fitness The extent to which the log traces can be associated with valid execution paths specified by the process model A good fitness does not imply conformance Fitness alone cannot provide meaningful information

M EASUREMENT – T WO D IMENSIONS OF C ONFORMANCE 2. Appropriateness The degree of accuracy in which the process model describes the observed behavior, combined with the degree of clarity in which it is represented Two types of Appropriateness 1. Structural Appropriateness If a simple model can explain the log, why choose a complicated one 2. Behavioral Appropriateness The model should not be too generic and allow for too much behavior

V ISUAL E XAMPLE

Problems with these two models Figure 4(a) It covers a lot of extra behavior Allows for arbitrary sequences Figure 4(b) Does not allow for more sequences than those that were observed in the log It only lists the possible sequences instead of expressing the specified behavior in a meaningful way Authors Claim: “a ‘good’ process model should somehow be minimal in structure to clearly reflect the described behavior (structural appropriateness), and minimal in behavior to represent as closely as possible what actually takes place (behavioral appropriateness)”

M EASURING F ITNESS Measuring Fitness Replay the log in the model and measure the mismatch 1. Marking the initial place in the model 2. The transitions that belong to the logged events in the trace are fired one after another 3. During replay, the number of tokens that had to be created artificially (transitions (not enabled) logged events and therefore could not be successfully executed ) and the number of tokens that were left in the model (indication that the process was not properly completed ) are counted

E XAMPLE - L OG R EPLAY m=0 Case 1 st Trace from Event Log

E XAMPLE - L OG R EPLAY m>0 & r>0 Case 4 th Trace of Event Log r>0 indicates process did not complete properly

E XAMPLE - L OG R EPLAY ( CONT.) Ex) Calculation of metric f (whole event log L2; process description M1) Take note: traces i = 4 & 5 Contains missing and remaining tokens f(M1, L2) = ½(1-(50/10666)) + ½(1-( ) ≈ f(M1, L1) = 1 f(M1, L3) ≈ 0.540

E XAMPLE - L OG R EPLAY ( CONT.) Localization of Mismatch Remaining Tokens (+ sign) Missing Tokens (- sign) Ex) Transition H occurred while this was not possible according to the model Note: a final interpretation of this mismatch could only be given by a domain expert from the company Ex) The model lacks the possibility of skipping activity G

M EASURING A PPROPRIATENESS One way to remove mismatch from previous figure is: To adapt the process model to the process as it really happens (based on the observed behavior in the log) And to introduce an invisible task that enables the skipping of activity G Evaluate behavioral and structural appropriateness 1. Behavioral Appropriateness How much behavior is allowed by the model which was actually never used in the observed process executions in the log 2. Structural Appropriateness Whether a model is suitable since there exist several syntactic ways to express the same behavior in a process model

M EASURING A PPROPRIATENESS – B EHAVIORAL A PPROPRIATENESS Determine the mean number of enabled transitions during log replay Corresponds to the idea that an increase of alternatives or parallelisms, and thus an increase of potential behavior, will result in a higher number of enabled transitions during log replay

M EASURING A PPROPRIATENESS – B EHAVIORAL A PPROPRIATENESS

Calculation of Behavioral Appropriateness for model M4 Metric yields a’ B (M4, L2) = 1 (model M4 precisely allows for the behavior that was observed in event log L2) Calculation of Behavioral Appropriateness for model M5 Metric yields a’ B (M5, L2) = [19 / (2· 20)] + [ 20 / (2· 21)] ≈ 0.951

M EASURING A PPROPRIATENESS – S TRUCTURAL A PPROPRIATENESS

B ALANCING F ITNESS AND A PPROPRIATENESS Fitness, behavioral appropriateness, and structural appropriateness are orthogonal to each other (all measure something different; thus improvement in one area is not really comparable to an improvement according to another) If we equally weigh the three metrics f, a’ B, a’ S, then: M1: overall best conforming model for log L1 M4: best conforming model for log L2 M2: best conforming model for log L3

B ALANCING F ITNESS AND A PPROPRIATENESS The fitness dimension, in practical settings, is typically more dominant Thus it is recommended to carry out the conformance analysis in two phases 1. Analysis of Fitness 2. Analysis of Appropriateness