The Alignment of Formal, Structured and Unstructured Process Descriptions. Josep Carmona
|
|
- Stuart Gray
- 5 years ago
- Views:
Transcription
1 The Alignment of Formal, Structured and Unstructured Process Descriptions Josep Carmona
2 Thomas Chatain Luis delicado Farbod Taymouri Boudewijn van Dongen Han van der Aa Lluís Padró Josep Sànchez-Ferreres Andrea Burattin
3 Process information is stored in various ways Process Model Work Instructions Checklist Rules & Guidelines Logs Reason: Make information available in formats suitable for various purposes and stakeholders. Problem: Synchronization issues between several representations.
4 Process for becoming a member?
5 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home.
6 FORMAL (AND GRAPHICAL) DESCRIPTIONS: HARD TO UNDERSTAND BY EVERYONE
7 EVENT LOGS: STRUCTURED FOOTPRINTS OF PROCESS EXECUTIONS (I.E., THE REALITY, DUDE!!!)
8 EVENT LOGS: STRUCTURED FOOTPRINTS OF PROCESS EXECUTIONS (I.E., THE REALITY, DUDE!!!) Case 1: IndividualOrFamily(V), PersonalInf(V), SendInf(V), EnterInf(Z),... Case 2: IndividualOrFamily(V), FamilyInf(V), SendInf(V), WaitCard(V), EnterInf(Z),... Case 3:...
9
10
11 Bank ZOO Marketing Billing ZooClub VISITOR A X B C X D E F G + I + J + K H + L M N O P
12 A X B C X D E F G + I + J + K + H L M N O P
13 A B C D E F G I J K H L M N O P
14 A B C D E F m i G I J K H L M N O P
15 A B C D E F m i G I J K H L M N O P m f
16 A B C D E F G I J K H L M N O P
17 A B C D E F Model for the Reality G I J K H L M N O P
18 A B C D E F Model for the Reality G I J K H L M N O P The Reality <A,D,B,G,E,N,H,I,L,J,M,P,O,K>
19 THE ALIGNMENT BETWEEN MODELS AND TRACES GIVEN: COMPUTE: A B C D E F G I J K H L M N O P <A,D,B,G,E,N,H,I,L,J,M,P,O,K> A A > B D D B > G G E E > H N N H > I I L L J J M M > τ > O P P O > > K K > F τ > > τ τ Trace Model
20 THE ALIGNMENT BETWEEN MODELS AND TRACES GIVEN: COMPUTE: A B C D E F G I J K H L M N O P <A,D,B,G,E,N,H,I,L,J,M,P,O,K> A A > B D D B > G G E E > H N N H > I I L L J J M M > τ > O P P O > > K K > F τ > > τ τ Trace Model Synchronous Moves
21 THE ALIGNMENT BETWEEN MODELS AND TRACES GIVEN: COMPUTE: A B C D E F G I J K H L M N O P <A,D,B,G,E,N,H,I,L,J,M,P,O,K> A A > B D D B > G G E E > H N N H > I I L L J J M M > τ > O P P O > > K K > F τ > > τ τ Trace Model Model Moves
22 THE ALIGNMENT BETWEEN MODELS AND TRACES GIVEN: COMPUTE: A B C D E F G I J K H L M N O P <A,D,B,G,E,N,H,I,L,J,M,P,O,K> A A > B D D B > G G E E > H N N H > I I L L J J M M > τ > O P P O > > K K > F τ > > τ τ Trace Model Log Moves
23 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET:
24 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Process Model A B C D
25 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Process Model A B C D <A,D,B>
26 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Process Model A B C D Trace Net A D B
27 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: A B C D A D B Synchronous Product Net A D B
28 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Model Moves A B C D A D B Synchronous Product Net A D B
29 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Model Moves A B C D A D B Synchronous Product Net Log Moves A D B
30 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS ARISING FROM A. ADRIANSYAH PhD. (TU/e) COSTS CAN BE ASSIGNED TO SYNCHRONOUS/ASYNCHRONOUS MOVES CURRENT IMPLEMENTATION BASED ON THE NOTION OF SYNCHRONOUS PRODUCT NET: Model Moves A B C D Synchronous Moves A D B Synchronous Product Net Log Moves A D B
31 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B
32 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! COST 2 A B C D COST 1 A D B COST 2 A D B
33 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B
34 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B
35 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B A A
36 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B A A B >
37 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B A A B > D D
38 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS PROBLEM CASTED AS REACHABILITY WITH COSTS! A B C D A D B A D B A B D > A > D B
39 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS Finding an alignment for a given model and trace, for a given cost function: identify the cheapest firing sequence from m i to m f in the synchronous product net For reset/inhibitor nets this problem is UNDECIDABLE, For Petri nets this problem is EXPSPACE hard, For 1-safe nets, this problem is PSPACE hard, For free-choice petri nets this problem is NP hard, For marked graphs, this problem is POLYNOMIAL
40 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS Finding an alignment for a given model and trace, for a given cost function: identify the cheapest firing sequence from m i to m f in the synchronous product net For reset/inhibitor nets this problem is UNDECIDABLE, For Petri nets this problem is EXPSPACE hard, For 1-safe nets, this problem is PSPACE hard, For free-choice petri nets this problem is NP hard, For marked graphs, this problem is POLYNOMIAL WHAT TO DO!???
41 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS EXPLICIT EXPLORATION (A*) STRUCTURAL THEORY (MARKING EQUATION) APPROXIMATE APPROACHES SUB-OPTIMAL APPROACHES EVENT STRUCTURES (UNFOLDINGS) DECOMPOSITIONAL APPROACHES ONLINE APPROACHES
42 EXPLICIT EXPLORATION (A*) The search space is the statespace of the synchronous product model Each node is a combination of a state in the model and the remaining events in the trace Each arc is a move on model, move on log or a synchronous move A heuristic function estimates the remaining distance to the final node Optimality guaranteed! Memory & time consuming!
43 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS EXPLICIT EXPLORATION (A*) STRUCTURAL THEORY (MARKING EQUATION) APPROXIMATE APPROACHES SUB-OPTIMAL APPROACHES EVENT STRUCTURES (UNFOLDINGS) DECOMPOSITIONAL APPROACHES ONLINE APPROACHES
44
45 STRUCTURAL THEORY OVER THE MARKING EQUATION For any given Petri net with initial marking m i, firing sequence s leading to final marking m f, holds: m i + N x = m f (marking equation) with x the Parikh vector of s Minimizing c(x) leads to an underestimate for c(s), and hence an underestimate for the cheapest path from m i to m f. x does not necessarily correspond to a realizable firing sequence For some class (e.g., free-choice nets): if x is an integer solution to the marking equation for m i and m f, then there exists a firing sequence s from m i to m f.
46 STRUCTURAL THEORY OVER THE MARKING EQUATION For any given Petri net with initial marking m i, firing sequence s leading to final marking m f, holds: m i + N x = m f (marking equation) with x the Parikh vector of s Minimizing c(x) leads to an underestimate for c(s), and hence an underestimate for the cheapest path from m i to m f. x does not necessarily correspond to a realizable firing sequence For some class (e.g., free-choice nets): if x is an integer solution to the marking equation for m i and m f, then there exists a firing sequence s from m i to m f. Marking equation used to prune the search space in A* What about to provide alignments?
47 APPROXIMATE ALIGNMENTS Computing alignments more efficiently Computing alignments at different level of granularities
48 APPROXIMATE ALIGNMENTS Computing alignments more efficiently Computing alignments at different level of granularities Process Model Trace METHOD Approximate Alignment
49 APPROXIMATE ALIGNMENTS Computing alignments more efficiently Computing alignments at different level of granularities Process Model Trace METHOD Approximate Alignment Finest Level (Traditional Alignment) α 3 = a b f c a b > c f >
50 APPROXIMATE ALIGNMENTS Computing alignments more efficiently Computing alignments at different level of granularities Process Model Trace METHOD Most Coarse Level α 1 = {a, b, f, c} {a, f, b, c} Approximate Alignment α 2 = a a b b {f, c} {c, f} Finest Level (Traditional Alignment) α 3 = a b f c a b > c f >
51 APPROXIMATE ALIGNMENTS Computing alignments more efficiently Computing alignments at different level of granularities Process Model Trace METHOD Most Coarse Level α 1 = {a, b, f, c} {a, f, b, c} Approximate Alignment α 2 = a a b b {f, c} {c, f} Memory Usage Finest Level (Traditional Alignment) α 3 = a b f c a b > c f > Execution Time
52 σ Parikh Similarity σ ILP Ordering α {σ σ }
53 σ Parikh Similarity σ ILP Ordering α {σ σ } APPROXIMATE ALIGNMENTS Parikh Similarity: Looking for a Parikh Vector that maximizes similarity to the Parikh representation of σ ILP Ordering: Computing an Approximate Alignment Based on a User-Defined Granularity Based on the marking equation!
54 PARIKH SIMILARITY ^ Let J = T supp σ : Minimize Σ t J X s t Σ t J X[t] Subject to: m f = m i + NX ^ t J: σ t = X t + X s [t] X, X s 0 ^ For a i : If X i < σ(a i ) Reset a i σ Parikh Similarity σ ILP Ordering α {σ σ }
55 PARIKH SIMILARITY ^ Let J = T supp σ : Minimize Σ t J X s t Σ t J X[t] Subject to: m f = m i + NX ^ t J: σ t = X t + X s [t] X, X s 0 ^ For a i : If X i < σ(a i ) Reset a i in σ σ Parikh Similarity σ ILP Ordering α {σ σ }
56 ILP ORDERING σ Parikh Similarity σ ILP Ordering α {σ σ }
57 ILP ORDERING ^ Let J = T supp(σ ) σ Parikh Similarity σ ILP Ordering α {σ σ }
58 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 First step σ Parikh Similarity σ ILP Ordering α {σ σ }
59 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 First step λ 1 th step σ Parikh Similarity σ ILP Ordering α {σ σ }
60 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 Marking Equation: m λ = m λ 1 + NX λ m λ 0, X λ 0 First step λ 1 th step Final step σ Parikh Similarity σ ILP Ordering α {σ σ }
61 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 Marking Equation: m λ = m λ 1 + NX λ m λ 0, X λ 0 Step Granularity: Σ t X1 X 1 t + X 1 s t η Σ t Xλ 1 Step Granularity : s X λ 1 t + X λ 1 t η Step Granularity: m λ end = 1 First step λ 1 th step Final step σ Parikh Similarity σ ILP Ordering α {σ σ }
62 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Parikh Equality λ t J:Σ i=1 X i t + X s i t σ ^ (t) Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 Marking Equation: m λ = m λ 1 + NX λ m λ 0, X λ 0 Step Granularity: Σ t X1 X 1 t + X 1 s t η Σ t Xλ 1 Step Granularity : s X λ 1 t + X λ 1 t η Step Granularity: m λ end = 1 First step λ 1 th step Final step σ Parikh Similarity σ ILP Ordering α {σ σ }
63 ILP ORDERING ^ Let J = T supp(σ ) Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Parikh Equality λ t J:Σ i=1 X i t + X s i t σ ^ (t) Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 Marking Equation: m λ = m λ 1 + NX λ m λ 0, X λ 0 Step Granularity: Σ t X1 X 1 t + X 1 s t η Σ t Xλ 1 Step Granularity : s X λ 1 t + X λ 1 t η Step Granularity: m λ end = 1 Mimic: ^ t J:X 1 t σ 1 [t] Mimic: ^ t J: X λ 1 t σ λ 1 [t] Mimic: ^ t J: X λ t σ λ [t] First step λ 1 th step Final step σ Parikh Similarity σ ILP Ordering α {σ σ }
64 ILP ORDERING ^ Let J = T supp(σ ) Objective Function: Minimize λ Σ i=1 c X i,xs i Marking Equation: m 1 = m 0 + NX 1 m 1 0, X 1 0 Parikh Equality λ t J:Σ i=1 X i t + X s i t σ ^ (t) Marking Equation: m λ 1 = m λ 2 + NX λ 1 m λ 1 0, X λ 1 0 Marking Equation: m λ = m λ 1 + NX λ m λ 0, X λ 0 Step Granularity: Σ t X1 X 1 t + X 1 s t η Σ t Xλ 1 Step Granularity : s X λ 1 t + X λ 1 t η Step Granularity: m λ end = 1 Mimic: ^ t J:X 1 t σ 1 [t] Mimic: ^ t J: X λ 1 t σ λ 1 [t] Mimic: ^ t J: X λ t σ λ [t] First step λ 1 th step Final step σ Parikh Similarity σ ILP Ordering α {σ σ }
65 RECURSIVE ILP ORDERING σ Recursive Algorithm σ Parikh Similarity σ ILP Ordering α {σ σ }
66 RECURSIVE ILP ORDERING σ Recursive Algorithm ILP Ordering ILP Ordering ILP Ordering σ Parikh Similarity σ ILP Ordering α {σ σ }
67 RECURSIVE ILP ORDERING σ Recursive Algorithm ILP Ordering ILP Ordering ILP Ordering α 1 α λ 1 α λ α = α 1 α 2 α λ 1 α λ σ Parikh Similarity σ ILP Ordering α {σ σ }
68 RECURSIVE ILP ORDERING σ Recursive Algorithm ILP Ordering ILP Ordering ILP Ordering Number of variables: T + J + P ( σ η ) α 1 α λ 1 α λ α = α 1 α 2 α λ 1 α λ σ Parikh Similarity σ ILP Ordering α {σ σ }
69 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS EXPLICIT EXPLORATION (A*) STRUCTURAL THEORY (MARKING EQUATION) APPROXIMATE APPROACHES SUB-OPTIMAL APPROACHES K OF X PREFIX-ALIGNMENT INDICATION-BASED REDUCTION EVENT STRUCTURES (UNFOLDINGS) DECOMPOSITIONAL APPROACHES ONLINE APPROACHES
70 The firing rule of Petri nets can also be translated in this form, namely, if t is enabled in marking m: m + N - 1 t 0 Where N - is the consumption matrix of the Petri net and a 1 t vector with value 1 for transition t and 0 otherwise. This can be combined into a larger ILP problem for k of x prefix alignments.
71 We can construct an ILP, that guarantees that: The first x transitions can be executed in that order (using the firing rule equations) The remainder of the trace is a solution to the marking equation (and hence for free choice nets, the final marking is reachable from the marking reached after firing the first x transitions) k out of the first x transitions correspond to an event (log-move or sync-move) The cost function is minimal. Then iteratively, we keep the x transitions and solve the problem for the remaining elements of the trace.
72 ALIGNMENTS BETWEEN EVENT LOGS AND PROCESS MODELS EXPLICIT EXPLORATION (A*) STRUCTURAL THEORY (MARKING EQUATION) APPROXIMATE APPROACHES SUB-OPTIMAL APPROACHES K OF X PREFIX-ALIGNMENT INDICATION-BASED REDUCTION EVENT STRUCTURES (UNFOLDINGS) DECOMPOSITIONAL APPROACHES ONLINE APPROACHES
73 INDICATION-BASED REDUCTION APPROACH N Model Reduction N r Computing Macro- Alignment α r Alignment Expansion α σ Log Reduction σ r Model reduction inspired in the Reveals Relation (by Stefan Haar) Benefit from well-structuredness to extract Single-Entry Single-Exit components Localy optimal (applying [Needleman, S., Wunsch] DP technique)
74 t 6 t 19 t 2 t 7 t 16 t 25 t 22 t 20 t 8 t 1 t 5 t 15 t 26 t 10 t 3 t 17 t 21 t 24 t 11 t 4 t 12 t 13 t 18 t 14
75 t 6 t 19 t 2 t 7 t 16 t 25 t 22 t 20 t 8 t 1 t 5 t 15 t 26 t 10 t 3 t 17 t 21 t 24 t 11 t 4 t 12 t 13 t 18 t 14
76 t 6 t 19 t 2 t 7 t 16 t 25 t 22 t 20 t 8 t 1 t 5 t 15 t 26 t 10 t 3 t 17 t 21 t 24 t 11 t 4 t 12 t 13 t 18 t 14
77 t 2 t 6, t 7, t 8 {t 16 } t 19 t a 16 t 25 t 22 t 20 t 1 t 5 t 15 t 26 t 10 t 3 t 17 t 21 t 24 t 11 t 4 t 12 t 13 t 18 t 14
78 t 2 t 6, t 7, t 8 {t 16 } t 25 t 19, t 20 {t 22 } t a 16 t a 22 t 1 t 5 t 15 t 26 t 10 t 3 t 17 t 21 t 24 t 11 t 12 t 4 t 13 t 18 t 14
79 t 2 t 6, t 7, t 8 {t 16 } t 25 t 19, t 20 {t 22 } t a 16 t a 22 t 1 t 10 t 15 {t 5 } t 5 a t 26 t 3 t 17 t 21 t 24 t 11 t 12 t 4 t 13 t 18 t 14
80 t 2 t 6, t 7, t 8 {t 16 } t 25 t 19, t 20 {t 22 } t a a 16 t 22 t 1 t 15 {t 5 } t 5 a t 26 a t 17 t 3 t 10, t 11 {t 17 } t 21 t 24 t 12 t 4 t 13 t 18 t 14
81 t 2 t 6, t 7, t 8 {t 16 } t 25 t 19, t 20 {t 22 } a t 16 t a 22 t 1 t 15 {t 5 } t 5 a t 26 a t 17 t 3 t 10, t 11 {t 17 } t 21 t 24 t 12 t 4 t 13 t 18 t 14
82 a t 16 t a 22 t 1 t 5 a t 26 a t 17 t 21 t 24 t 12 t 4 t 13 t 18 t 14
83 a t 16 t a 22 t 1 t 5 a t 26 a t 17 t 21 t 24 t 12 t 4 t 13 t 18 t 14
84 a t 16 t a 22 t 1 t 5 a t 26 a t 17 t 21 t 24 t 12 t 4 t 13 t 18 t 14
85 t aa 22 t 1 t 5 a t 26 a t 17 t 12 t 4 t 13 t 14 t 18 Saturated!
86 Model Indication Model Indication Local Alignments by Dynamic Programming [Needleman & Wunsch, 1970] Observed Indication of t a 17 = t 3 t 11, t 10 t 3 t 11 and {t 3 }{t 10 } Model Indication of t a 17 = t 3 t 11, t 10 t 17 t 3 t 11 t 17 and {t 3 }{t 10 }{t 17 } Observed Indication Observed Indication t 3 t 11 t 3 t t t t t t Optimal score t Optimal score (t 3,t 3 )(t 11,t 11 )(, t 17 ) (t 3, t 3 )(t 10,t 10 )(, t 17 )
87 Aligning Observed Indication to Model indication Observed Indication of t a 17 = t 3 t 11, t 10 t 3 t 11 and {t 3 }{t 10 } Model Indication of t a 17 = t 3 t 11, t 10 t 17 t 3 t 11 t 17 and {t 3 }{t 10 }{t 17 } Optimal alignment for t a 17 = (t 3, t 3 ){ t 11, t 11, t 10, t 10 }(, t 17 ) α r = t 1 t 1 t 5 a > ta 17 ta 17 t 21 t 21 > t 24 > t 5 a ta 16 ta 16 a t 22 a t 22 t 26 t 26 t 1 t 5 α = t 1 > t 3 t 11 t 10 > t 21 > > > t 6 t 2 t 3 t 11 t 10 t 17 t 21 t 24 t 5 > t 2 t 15 t 7 > > t 16 t 25 t 19 t 20 > t 7 t 6 t 8 t 16 t 25 t 19 t 20 t 25 t 26 t 26
88 RECAP ON ELvsPM Challenging problem Many perspectives can be considered (the talk has only presented few...) Structural Theory clearly has a role Topics that I have not touched Anti-alignments Multi-alignments Decomposed approaches Partial-orders Online approaches
89
90 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home.
91 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home. + control-flow
92 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home. + actions
93 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home. + roles & units
94 TEXTUAL DESCRIPTIONS: THEY REPRESENT UNSTRUCTURED SOURCE OF PROCESS INFORMATION. When a visitor wants to become a member of Barcelona's ZooClub, the following steps must be taken. First of all, the customer must decide whether he wants an individual or family membership. If he wants an individual membership, he must prepare his personal information. If he wants a family membership instead, he should prepare the information for its spouse and spawn as well. The customer must then give this information to the ZooClub department. The ZooClub department introduces the visitor's personal data into the system and takes the payment request to the Billing department. The ZooClub department also forwards the visitor's information to the marketing department. The billing department sends the payment request to the bank. The bank processes the payment information and, if everything is correct, charges the payment into user's account. Once the payment is confirmed, the ZooClub department can print the card and deliver it to the visitor. In the meantime, the Marketing department makes a request to mail the Zoo Club's magazine to the visitor's home. Once the visitor receives the card, he can go home. + coreferences/anaphora
95 NATURAL LANGUAGE PROCESSING (NLP) Performed NLP Steps: PoS Tagging & Lemmatization Sense Disambiguation Semantic Role Labelling Coreference Resolution Freeling: An Open-Source suite of language analyzers [1] Padró, L., Stanilovsky, E.: Freeling 3.0: Towards wider multilinguality. In: Proceedings of the Eighth International Conference on Language Resources and Evaluation, LREC, Istanbul, Turkey (May 2012)
96
97
98 Analyzer Textual Description Sentence 1: _ Tokens: when, user, wants, become _ Sematic Roles: _ Agent: user _ Action: take _ Patient: following, step Sentence 2: BPMN Process Model Task Label 1: _ Tokens: decide, individual, family, ticket _ Sematic Roles: _ Agent: client _ Action: decide _ Patient: individual, family, ticket Task Label 2: Filtered Model
99
100 FEATURE EXTRACTION (TEXT) "If he wants an individual membership, he must prepare his personal information." Contains the noun "customer" Contains the adjective "individual" Contains the action "prepare" The agent of verb "prepare" is "customer" The object of verb "prepare" is "information" Contains the synset n (client) The agent of verb "want" is "customer" Follows a conditional with: "individual", "membership"
101 FEATURE EXTRACTION (MODEL) Contains the action "prepare" Contains the adjective "personal" Contains the noun "information" The agent of verb "prepare" is "user" The object of verb "prepare" is "information" Contains the synset n (client) Follows a conditional with "family", "membership"
102
103 Contains the noun "customer" Contains the adjective "individual" Contains the action "prepare" The agent of verb "prepare" is "customer" The object of verb "prepare" is "information" Contains the synset n (client) The agent of verb "want" is "customer" Weighted Overlapping Index Contains the action "prepare" The agent of verb "prepare" is "customer" Contains the adjective "personal" Contains the noun "information Similarity = 0.938
104 Weighted Overlapping Index Contains the action "prepare" The agent of verb "prepare" is "customer" Contains the noun "information" Contains the action "prepare" The agent of verb "prepare" is "customer" Contains the adjective "personal" Contains the noun "information" = 0.938
105 Weighted Overlapping Index Contains the action "prepare" The agent of verb "prepare" is "customer" Contains the noun "information" Contains the action "prepare" The agent of verb "prepare" is "customer" Contains the adjective "personal" Contains the noun "information" = 0.938
106
107 ORDERING COMPUTATION DETERMINE THE ORDER RELATIONS OF TASKS AND SENTENCES Strict order Reverse order FOR THE MODEL, WE USE BEHAVIORAL PROFILES (Weidlich, 2010) FOR THE TEXT, SENTENCE LINEARITY IS ASSUMED Exclusivity # Parallelism
108
109 OPTIMIZATION PROBLEM (ILP) Model Order Matrix T1 T2 T3 T4 T1 # T2 # T3 # T4 # Similarity Matrix T1 T2 T3 T4 S S S S Text Order Matrix S1 S2 S3 S4 S1 # S2 # S3 # S4 #
110 NLP4BPM.CS.UPC.EDU
111 RECAP ON TDvsPM NLP widens the scope of Processes and Process Models Again, a challenging problem (specially at the NLP part) Nice topics for PhD Thesis! From Text to Models (going beyond [Friedrich et al.]) Collaborative/Cognitive BPM...
112
113
114 TOOL SUPPORT (ALL EDGES IN THE TRIANGLE) ELvsPM: ProM ( Lana LABS (Commercial) TDvsPM, ELvsTD:
115
116 The Alignment of Formal, Structured and Unstructured Process Descriptions Josep Carmona
A Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments. Boudewijn van Dongen Josep Carmona Thomas Chatain
A Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments Boudewijn van Dongen Josep Carmona Thomas Chatain Conformance in Process Mining Process Modeling Model Process Mining
More informationAutomatic Root Cause Identification Using Most Probable Alignments
Automatic Root Cause Identification Using Most Probable Alignments Marie Koorneef, Andreas Solti 2, Henrik Leopold, Hajo A. Reijers,3 Department of Computer Sciences, Vrije Universiteit Amsterdam, The
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 17 - Diagnosis for WF nets 1 Object We study suitable diagnosis techniques
More informationPetri nets. s 1 s 2. s 3 s 4. directed arcs.
Petri nets Petri nets Petri nets are a basic model of parallel and distributed systems (named after Carl Adam Petri). The basic idea is to describe state changes in a system with transitions. @ @R s 1
More informationChecking Behavioral Conformance of Artifacts
Checking Behavioral Conformance of Artifacts Dirk Fahland Massimiliano de Leoni Boudewijn F. van Dongen Wil M.P. van der Aalst, Eindhoven University of Technology, The Netherlands (d.fahland m.d.leoni
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 08 - Petri nets basics 1 Object Formalization of the basic concepts of
More informationPetri Nets (for Planners)
Petri (for Planners) B. Bonet, P. Haslum... from various places... ICAPS 2011 & Motivation Petri (PNs) is formalism for modelling discrete event systems Developed by (and named after) C.A. Petri in 1960s
More informationLecture 13: Structured Prediction
Lecture 13: Structured Prediction Kai-Wei Chang CS @ University of Virginia kw@kwchang.net Couse webpage: http://kwchang.net/teaching/nlp16 CS6501: NLP 1 Quiz 2 v Lectures 9-13 v Lecture 12: before page
More informationCommunication in Petri nets
Communication in Petri nets Kamal Lodaya work in progress with Ramchandra Phawade The Institute of Mathematical Sciences, Chennai February 2010 Petri nets - introduction Mathematical model. Widely used
More informationProcess Discovery and Conformance Checking Using Passages
Fundamenta Informaticae XX (2012) 1 35 1 DOI 10.3233/FI-2012-0000 IOS Press Process Discovery and Conformance Checking Using Passages W.M.P. van der Aalst Department of Mathematics and Computer Science,
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationBusiness Process Management
Business Process Management Theory: The Pi-Calculus Frank Puhlmann Business Process Technology Group Hasso Plattner Institut Potsdam, Germany 1 What happens here? We discuss the application of a general
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More informationA Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments
A Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments B.F. van Dongen 1, J. Carmona 2, and T. Chatain 3 1 Eindhoven University of Technology, The Netherlands b.f.v.dongen@tue.nl
More informationStatistical Machine Translation. Part III: Search Problem. Complexity issues. DP beam-search: with single and multi-stacks
Statistical Machine Translation Marcello Federico FBK-irst Trento, Italy Galileo Galilei PhD School - University of Pisa Pisa, 7-19 May 008 Part III: Search Problem 1 Complexity issues A search: with single
More informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationDiscrete Event Systems Exam
Computer Engineering and Networks Laboratory TEC, NSG, DISCO HS 2016 Prof. L. Thiele, Prof. L. Vanbever, Prof. R. Wattenhofer Discrete Event Systems Exam Friday, 3 rd February 2017, 14:00 16:00. Do not
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationA Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundamenta Informaticae XX (2004) 1 23 1 IOS Press A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs Javier Esparza Institute for Formal Methods in Computer Science
More informationIntroduction to Computers & Programming
16.070 Introduction to Computers & Programming Theory of computation: What is a computer? FSM, Automata Prof. Kristina Lundqvist Dept. of Aero/Astro, MIT Models of Computation What is a computer? If you
More informationInformation System Design IT60105
Information System Design IT60105 Lecture 8 Use Case Diagrams Lecture #8 What is a use-case diagram? Example: On-line purchase (OLP) system Use-case diagram of OLP system Different components in a use-case
More informationConformance Checking of Interacting Processes With Overlapping Instances
Conformance Checking of Interacting Processes With Overlapping Instances Dirk Fahland, Massimiliano de Leoni, Boudewijn F. van Dongen, and Wil M.P. van der Aalst Eindhoven University of Technology, The
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
More informationStatistical Methods for NLP
Statistical Methods for NLP Information Extraction, Hidden Markov Models Sameer Maskey Week 5, Oct 3, 2012 *many slides provided by Bhuvana Ramabhadran, Stanley Chen, Michael Picheny Speech Recognition
More informationLecture 8: Complete Problems for Other Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 8: Complete Problems for Other Complexity Classes David Mix Barrington and Alexis Maciel
More informationExploiting Interleaving Semantics in Symbolic State Space Generation
Exploiting Interleaving Semantics in Symbolic State Space Generation GIANFRANCO CIARDO ciardo@cs.ucr.edu Dept. of Computer Science and Engineering, University of California, Riverside, CA GERALD LÜTTGEN
More informationEfficient Computation of Causal Behavioural Profiles using Structural Decomposition
Efficient Computation of Causal Behavioural Profiles using Structural Decomposition Matthias Weidlich 1, Artem Polyvyanyy 1, Jan Mendling 2, and Mathias Weske 1 1 Hasso Plattner Institute at the University
More informationAn Experimental Evaluation of Passage-Based Process Discovery
An Experimental Evaluation of Passage-Based Process Discovery H.M.W. Verbeek and W.M.P. van der Aalst Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513, 5600
More informationGeneralised Computation of Behavioural Profiles based on Petri-Net Unfoldings
Generalised Computation of Behavioural Profiles based on Petri-Net Unfoldings Matthias Weidlich, Felix Elliger, and Mathias Weske Hasso Plattner Institute at the University of Potsdam, Germany {Matthias.Weidlich,Mathias.Weske}@hpi.uni-potsdam.de
More informationMPRI 1-22 Introduction to Verification January 4, TD 6: Petri Nets
TD 6: Petri Nets 1 Modeling Using Petri Nets Exercise 1 (Traffic Lights). Consider again the traffic lights example from the lecture notes: r r ry y r y ry g g y g 1. How can you correct this Petri net
More informationExtensions to the CEGAR Approach on Petri Nets
Acta Cybernetica 21 (2014) 401 417. Extensions to the CEGAR Approach on Petri Nets Ákos Hajdu, András Vörös, Tamás Bartha, and Zoltán Mártonka Abstract Formal verification is becoming more prevalent and
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 24, 2016 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,
More informationA Canonical Contraction for Safe Petri Nets
A Canonical Contraction for Safe Petri Nets Thomas Chatain and Stefan Haar INRIA & LSV (CNRS & ENS Cachan) 6, avenue du Président Wilson 935 CACHAN Cedex, France {chatain, haar}@lsvens-cachanfr Abstract
More informationWorst-Case Execution Time Analysis. LS 12, TU Dortmund
Worst-Case Execution Time Analysis Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 02, 03 May 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 53 Most Essential Assumptions for Real-Time Systems Upper
More informationLecture 12: Algorithms for HMMs
Lecture 12: Algorithms for HMMs Nathan Schneider (some slides from Sharon Goldwater; thanks to Jonathan May for bug fixes) ENLP 17 October 2016 updated 9 September 2017 Recap: tagging POS tagging is a
More informationDiscovering Petri Nets
Discovering Petri Nets It s a kind of magic Prof.dr.ir. Wil van der Aalst Eindhoven University of Technology Department of Information and Technology P.O. Box 513, 5600 MB Eindhoven The Netherlands w.m.p.v.d.aalst@tm.tue.nl
More informationDrFurby Classifier. Process Discovery BPM Where innovation starts
Den Dolech 2, 5612 AZ Eindhoven P.O. Box 513, 5600 MB Eindhoven The Netherlands www.tue.nl Author Eric Verbeek and Felix Mannhardt Date June 14, 2016 Version 1.2 DrFurby Classifier Process Discovery Contest
More informationCS 170 Algorithms Fall 2014 David Wagner MT2
CS 170 Algorithms Fall 2014 David Wagner MT2 PRINT your name:, (last) SIGN your name: (first) Your Student ID number: Your Unix account login: cs170- The room you are sitting in right now: Name of the
More informationThe efficiency of identifying timed automata and the power of clocks
The efficiency of identifying timed automata and the power of clocks Sicco Verwer a,b,1,, Mathijs de Weerdt b, Cees Witteveen b a Eindhoven University of Technology, Department of Mathematics and Computer
More informationParsing with Context-Free Grammars
Parsing with Context-Free Grammars Berlin Chen 2005 References: 1. Natural Language Understanding, chapter 3 (3.1~3.4, 3.6) 2. Speech and Language Processing, chapters 9, 10 NLP-Berlin Chen 1 Grammars
More informationInteger Linear Programming Based Property Checking for Asynchronous Reactive Systems
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 Integer Linear Programming Based Property Checking for Asynchronous Reactive Systems Stefan Leue Department of Computer and Information Science University of
More informationDistributed Process Discovery and Conformance Checking
Distributed Process Discovery and Conformance Checking prof.dr.ir. Wil van der Aalst www.processmining.org On the different roles of (process) models PAGE 1 Play-Out PAGE 2 Play-Out (Classical use of models)
More informationCausal Nets: A Modeling Language Tailored towards Process Discovery
Causal Nets: A Modeling Language Tailored towards Process Discovery Wil van der Aalst, Arya Adriansyah, and Boudewijn van Dongen Department of Mathematics and Computer Science, Technische Universiteit
More informationDecomposing Alignment-based Conformance Checking of Data-aware Process Models
Decomposing Alignment-based Conformance Checking of Data-aware Process Models Massimiliano de Leoni 1, Jorge Munoz-Gama 2, Josep Carmona 2, and Wil M.P. van der Aalst 1 1 Eindhoven University of Technology,
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programming II Date: 10/12/17 12.1 Introduction Today we re going to do a couple more examples of dynamic programming. While
More informationMarkings in Perpetual Free-Choice Nets Are Fully Characterized by Their Enabled Transitions
Markings in Perpetual Free-Choice Nets Are Fully Characterized by Their Enabled Transitions Wil M.P. van der Aalst Process and Data Science (PADS), RWTH Aachen University, Germany. wvdaalst@pads.rwth-aachen.de
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationTrace- and Failure-Based Semantics for Responsiveness
Trace- and Failure-Based Semantics for Responsiveness Walter Vogler 1 and Christian Stahl 2 and Richard Müller 2,3 1 Institut für Informatik, Universität Augsburg, Germany vogler@informatik.uni-augsburg.de
More information1 From previous lectures
CS 810: Introduction to Complexity Theory 9/18/2003 Lecture 11: P/poly, Sparse Sets, and Mahaney s Theorem Instructor: Jin-Yi Cai Scribe: Aparna Das, Scott Diehl, Giordano Fusco 1 From previous lectures
More informationThe Polynomial Hierarchy
The Polynomial Hierarchy Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Motivation..synthesizing circuits is exceedingly difficulty. It is even
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationSequence Labeling: HMMs & Structured Perceptron
Sequence Labeling: HMMs & Structured Perceptron CMSC 723 / LING 723 / INST 725 MARINE CARPUAT marine@cs.umd.edu HMM: Formal Specification Q: a finite set of N states Q = {q 0, q 1, q 2, q 3, } N N Transition
More informationProblem set 1. (c) Is the Ford-Fulkerson algorithm guaranteed to produce an acyclic maximum flow?
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 1 Electronic submission to Gradescope due 11:59pm Thursday 2/2. Form a group of 2-3 students that is, submit one homework with all of your names.
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationWorst-Case Execution Time Analysis. LS 12, TU Dortmund
Worst-Case Execution Time Analysis Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 09/10, Jan., 2018 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 43 Most Essential Assumptions for Real-Time Systems Upper
More informationDecomposing Conformance Checking on Petri Nets with Data
Decomposing Conformance Checking on Petri Nets with Data Massimiliano de Leoni 1,2, Jorge Munoz-Gama 3, Josep Carmona 3, and Wil M.P. van der Aalst 2 1 University of Padua, Padua (Italy) 2 Eindhoven University
More informationSleptsov Net Computing
International Humanitarian University http://mgu.edu.ua Sleptsov Net Computing Dmitry Zaitsev http://member.acm.org/~daze Write Programs or Draw Programs? Flow charts Process Charts, Frank and Lillian
More informationBusiness Process Technology Master Seminar
Business Process Technology Master Seminar BPT Group Summer Semester 2008 Agenda 2 Official Information Seminar Timeline Tasks Outline Topics Sergey Smirnov 17 April 2008 Official Information 3 Title:
More informationLog-Linear Models, MEMMs, and CRFs
Log-Linear Models, MEMMs, and CRFs Michael Collins 1 Notation Throughout this note I ll use underline to denote vectors. For example, w R d will be a vector with components w 1, w 2,... w d. We use expx
More informationDISCOVERING BLOCK STRUCTURED PARALLEL PROCESS MODELS FROM CAUSALLY COMPLETE EVENT LOGS
Journal of ELECTRICAL ENGINEERING, VOL 67 (2016), NO2, 111 123 DISCOVERING BLOCK STRUCTURED PARALLEL PROCESS MODELS FROM CAUSALLY COMPLETE EVENT LOGS Julijana Lekić Dragan Milićev α-algorithm is suitable
More informationLearning Hybrid Process Models From Events
Learning Hybrid Process Models From Events Process Discovery Without Faking Confidence (Experimental Results) Wil M.P. van der Aalst 1,2 and Riccardo De Masellis 2 and Chiara Di Francescomarino 2 and Chiara
More informationLecture 12: Algorithms for HMMs
Lecture 12: Algorithms for HMMs Nathan Schneider (some slides from Sharon Goldwater; thanks to Jonathan May for bug fixes) ENLP 26 February 2018 Recap: tagging POS tagging is a sequence labelling task.
More informationTime Petri Nets. Miriam Zia School of Computer Science McGill University
Time Petri Nets Miriam Zia School of Computer Science McGill University Timing Specifications Why is time introduced in Petri nets? To model interaction between activities taking into account their start
More informationGeorg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS
Georg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS Proceedings SDPS, Fifth World Conference on Integrated Design and Process Technologies, IEEE International Conference on Systems Integration, Dallas,
More informationIntelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 19 Oct, 23, 2015 Slide Sources Raymond J. Mooney University of Texas at Austin D. Koller, Stanford CS - Probabilistic Graphical Models D. Page,
More informationCollaborative NLP-aided ontology modelling
Collaborative NLP-aided ontology modelling Chiara Ghidini ghidini@fbk.eu Marco Rospocher rospocher@fbk.eu International Winter School on Language and Data/Knowledge Technologies TrentoRISE Trento, 24 th
More informationFIS' Partnership with Zelle for P2P Payments
FIS' Partnership with Zelle for P2P Payments Chris Burfield, SVP, Digital Market Strategy Norman Marraccini, VP, Director of Digital Payment Product Strategy & Marketing Peter Tapling, Chief Revenue Officer,
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni - Invariants Object We introduce two relevant kinds of invariants for
More informationSpecification models and their analysis Petri Nets
Specification models and their analysis Petri Nets Kai Lampka December 10, 2010 1 30 Part I Petri Nets Basics Petri Nets Introduction A Petri Net (PN) is a weighted(?), bipartite(?) digraph(?) invented
More informationExtraction of Opposite Sentiments in Classified Free Format Text Reviews
Extraction of Opposite Sentiments in Classified Free Format Text Reviews Dong (Haoyuan) Li 1, Anne Laurent 2, Mathieu Roche 2, and Pascal Poncelet 1 1 LGI2P - École des Mines d Alès, Parc Scientifique
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More information7 Principal Component Analysis
7 Principal Component Analysis This topic will build a series of techniques to deal with high-dimensional data. Unlike regression problems, our goal is not to predict a value (the y-coordinate), it is
More informationc 2011 Nisha Somnath
c 2011 Nisha Somnath HIERARCHICAL SUPERVISORY CONTROL OF COMPLEX PETRI NETS BY NISHA SOMNATH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Aerospace
More informationEfficient Computation of Causal Behavioural Profiles using Structural Decomposition
Efficient Computation of Causal Behavioural Profiles using Structural Decomposition Matthias Weidlich 1, Artem Polyvyanyy 1, Jan Mendling 2, and Mathias Weske 1 1 Hasso Plattner Institute at the University
More informationAdditional Test Scores. Test Scores Cross Test Scores Subscores Now let's look at what to do next: Areas of Strength
SAT Practice Test D This test scanned: September 22, 2016 Verbal 770 Your Progress 1600 100 Math 660 Total* 130 / 1600 130 1200 1000 910 990 1060 800 600 00 Test A 8//2016 Test B 8/13/2016 Test C 8/27/2016
More informationAd Placement Strategies
Case Study 1: Estimating Click Probabilities Tackling an Unknown Number of Features with Sketching Machine Learning for Big Data CSE547/STAT548, University of Washington Emily Fox 2014 Emily Fox January
More informationGroups whose Word Problem is a Petri Net Language (DCFS2015)
Groups whose Word Problem is a Petri Net Language (DCFS2015) Gabriela Aslı Rino Nesin, Richard M. Thomas University of Leicester, Department of Computer Science 26/06/2015 Overview 1 Motivation and definitions
More informationLing 98a: The Meaning of Negation (Week 5)
Yimei Xiang yxiang@fas.harvard.edu 15 October 2013 1 Review Negation in propositional logic, oppositions, term logic of Aristotle Presuppositions Projection and accommodation Three-valued logic External/internal
More informationAssigning Ontology-Based Semantics to Process Models: The Case of Petri Nets
Assigning Ontology-Based Semantics to Process Models: The Case of Petri Nets Pnina Soffer 1, Maya Kaner 2, and Yair Wand 3 1 University of Haifa, Carmel Mountain 31905, Haifa, Israel 2 Ort Braude College,
More informationPetri Nets (for Planners) ICAPS Petri Nets (for Planners) Outline of the Tutorial. Introduction & Motivation
Petri Nets (for Planners) ICAPS 2009 Introduction Transition Systems Petri Nets Petri Nets for Planning Transition Systems Products and Petri Nets Branching Processes Verification Construction Search Procedures
More informationarxiv: v1 [cs.ds] 17 Mar 2017
arxiv:1703.06733v1 [cs.ds] 17 Mar 2017 Discovering Relaxed Sound Workflow Nets using Integer Linear Programming S.J. van Zelst, B.F. van Dongen, W.M.P. van der Aalst, and H.M.W. Verbeek Department of Mathematics
More informationAlgebra 1 Semester 2. Instructional Materials for the WCSD Math Common Finals
014-015 Algebra 1 Semester Instructional Materials for the WCSD Math Common Finals The Instructional Materials are for student and teacher use and are aligned to the Math Common Final blueprint for this
More informationCS 7180: Behavioral Modeling and Decisionmaking
CS 7180: Behavioral Modeling and Decisionmaking in AI Markov Decision Processes for Complex Decisionmaking Prof. Amy Sliva October 17, 2012 Decisions are nondeterministic In many situations, behavior and
More informationCan I Find a Partner?
Can I Find a Partner? Peter Massuthe 1, Alexander Serebrenik 2, Natalia Sidorova 2, and Karsten Wolf 3 1 Humboldt-Universität zu Berlin, Institut für Informatik Unter den Linden 6, 10099 Berlin, Germany
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationCausal Dataflow Analysis for Concurrent Programs
Causal Dataflow Analysis for Concurrent Programs Azadeh Farzan P. Madhusudan Department of Computer Science, University of Illinois at Urbana-Champaign. {afarzan,madhu}@cs.uiuc.edu Abstract. We define
More informationSemantic Equivalences and the. Verification of Infinite-State Systems 1 c 2004 Richard Mayr
Semantic Equivalences and the Verification of Infinite-State Systems Richard Mayr Department of Computer Science Albert-Ludwigs-University Freiburg Germany Verification of Infinite-State Systems 1 c 2004
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationAligning Event Logs and Process Models for Multi-Perspective Conformance Checking: An Approach Based on Integer Linear Programming
Aligning Event Logs and Process Models for Multi-Perspective Conformance Checking: An Approach Based on Integer Linear Programming Massimiliano de Leoni and Wil M. P. van der Aalst Eindhoven University
More informationSimulation of Spiking Neural P Systems using Pnet Lab
Simulation of Spiking Neural P Systems using Pnet Lab Venkata Padmavati Metta Bhilai Institute of Technology, Durg vmetta@gmail.com Kamala Krithivasan Indian Institute of Technology, Madras kamala@iitm.ac.in
More informationPart A. P (w 1 )P (w 2 w 1 )P (w 3 w 1 w 2 ) P (w M w 1 w 2 w M 1 ) P (w 1 )P (w 2 w 1 )P (w 3 w 2 ) P (w M w M 1 )
Part A 1. A Markov chain is a discrete-time stochastic process, defined by a set of states, a set of transition probabilities (between states), and a set of initial state probabilities; the process proceeds
More informationEvaluation and Validation
Evaluation and Validation Jian-Jia Chen (Slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2016 年 01 月 05 日 These slides use Microsoft clip arts. Microsoft copyright
More informationComputer Sciences Department
Computer Sciences Department 1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Computer Sciences Department 3 ADVANCED TOPICS IN C O M P U T A B I L I T Y
More informationSequence of Algebra AB SDC Units Aligned with the California Standards
Sequence of Algebra AB SDC Units Aligned with the California Standards Year at a Glance Unit Big Ideas Math Algebra 1 Textbook Chapters Dates 1. Equations and Inequalities Ch. 1 Solving Linear Equations
More informationfakultät für informatik informatik 12 technische universität dortmund Petri nets Peter Marwedel Informatik 12 TU Dortmund Germany
12 Petri nets Peter Marwedel Informatik 12 TU Dortmund Germany Introduction Introduced in 1962 by Carl Adam Petri in his PhD thesis. Focus on modeling causal dependencies; no global synchronization assumed
More informationMulti-Component Word Sense Disambiguation
Multi-Component Word Sense Disambiguation Massimiliano Ciaramita and Mark Johnson Brown University BLLIP: http://www.cog.brown.edu/research/nlp Ciaramita and Johnson 1 Outline Pattern classification for
More informationA First Course in Linear Algebra
A First Course in Linear Algebra An Open-Source Textbook Rob Beezer beezer@ups.edu Department of Mathematics and Computer Science University of Puget Sound Sage Developer Days 1 University of Washington
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationDensest subgraph computation and applications in finding events on social media
Densest subgraph computation and applications in finding events on social media Oana Denisa Balalau advised by Mauro Sozio Télécom ParisTech, Institut Mines Télécom December 4, 2015 1 / 28 Table of Contents
More information