Semantics, Verification, and Implementation of Workflows ... - YAWL

More documents

Recommendations

Info

2.4.1 Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . 28 2.4.2 Mapping to an RWF-net . . . . . . . . . . . . . . . . . . . 29 3 OR-join semantics 32 3.1 Original OR-join semantics . . . . . . . . . . . . . . . . . . . . . . 33 3.1.1 Problems with original OR-join semantics . . . . . . . . . 37 3.1.2 Optimistic and pessimistic approaches . . . . . . . . . . . 38 3.2 Proposed OR-join semantics . . . . . . . . . . . . . . . . . . . . . 40 3.2.1 Background definitions . . . . . . . . . . . . . . . . . . . . 40 3.2.2 Mapping from YAWL with OR-joins to reset nets . . . . . 40 3.2.3 Definition and illustration of OR-join semantics . . . . . . 41 3.3 Operationalising the OR-join . . . . . . . . . . . . . . . . . . . . . 43 3.3.1 Well structured transition systems (WSTS) . . . . . . . . 43 3.3.2 WSTSs and reset nets . . . . . . . . . . . . . . . . . . . . 44 3.3.3 Procedures . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 3.3.4 Worked examples . . . . . . . . . . . . . . . . . . . . . . . 48 3.4 Restriction techniques . . . . . . . . . . . . . . . . . . . . . . . . 50 3.4.1 Structural restriction . . . . . . . . . . . . . . . . . . . . . 50 3.4.2 Active projection . . . . . . . . . . . . . . . . . . . . . . . 54 3.5 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 3.5.1 Matching OR-split and an OR-join . . . . . . . . . . . . . 58 3.5.2 Loop and cancellation . . . . . . . . . . . . . . . . . . . . 59 3.5.3 Larger loop and cancellation . . . . . . . . . . . . . . . . . 59 3.5.4 Multiple OR-joins . . . . . . . . . . . . . . . . . . . . . . . 59 3.6 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 4 Verification techniques 63 4.1 Correctness notions . . . . . . . . . . . . . . . . . . . . . . . . . . 63 4.2 Verifying nets without OR-joins . . . . . . . . . . . . . . . . . . . 65 4.3 Verifying nets with OR-joins . . . . . . . . . . . . . . . . . . . . . 67 4.4 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 4.5 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 5 Reduction rules for RWF-nets 74 5.1 Reduction rules for RWF-nets . . . . . . . . . . . . . . . . . . . . 74 5.1.1 Fusion of series places . . . . . . . . . . . . . . . . . . . . 75 5.1.2 Fusion of series transitions . . . . . . . . . . . . . . . . . . 82 5.1.3 Fusion of parallel places . . . . . . . . . . . . . . . . . . . 88 5.1.4 Fusion of parallel transitions . . . . . . . . . . . . . . . . . 90
5.1.5 Elimination of self-loop transitions . . . . . . . . . . . . . 92 5.1.6 Fusion of equivalent subnets . . . . . . . . . . . . . . . . . 95 5.1.7 Abstraction . . . . . . . . . . . . . . . . . . . . . . . . . . 98 5.2 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100 6 Reduction rules for YAWL nets 102 6.1 Reduction rules for YAWL nets without OR-joins . . . . . . . . . 102 6.1.1 Fusion of series conditions . . . . . . . . . . . . . . . . . . 102 6.1.2 Fusion of parallel conditions . . . . . . . . . . . . . . . . . 104 6.1.3 Fusion of alternative conditions . . . . . . . . . . . . . . . 106 6.1.4 Fusion of series tasks . . . . . . . . . . . . . . . . . . . . . 107 6.1.5 Fusion of parallel tasks . . . . . . . . . . . . . . . . . . . . 109 6.1.6 Fusion of alternative tasks . . . . . . . . . . . . . . . . . . 110 6.1.7 Elimination of self-loop tasks . . . . . . . . . . . . . . . . 112 6.1.8 Fusion of AND-split and AND-join tasks . . . . . . . . . . 113 6.1.9 Fusion of XOR-split and XOR-join tasks . . . . . . . . . . 115 6.2 Reduction rules for YAWL nets with OR-joins . . . . . . . . . . . 116 6.2.1 Fusion of an OR-join and another task . . . . . . . . . . . 118 6.2.2 Fusion of incoming edges to an OR-join . . . . . . . . . . . 120 6.3 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 6.3.1 YAWL reduction rules . . . . . . . . . . . . . . . . . . . . 121 6.3.2 Linking reduction rules to verification . . . . . . . . . . . . 123 6.4 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 7 Validation 127 7.1 Visa application process . . . . . . . . . . . . . . . . . . . . . . . 127 7.2 Illustrating the OR-join semantics . . . . . . . . . . . . . . . . . . 131 7.2.1 Enabling the cancel application task . . . . . . . . . . . . 133 7.2.2 Enabling the make decision task . . . . . . . . . . . . . . . 134 7.2.3 Enabling the calculate total points task . . . . . . . . . . . 135 7.3 Illustrating structural properties . . . . . . . . . . . . . . . . . . . 136 7.3.1 Verifying soundness . . . . . . . . . . . . . . . . . . . . . . 137 7.3.2 Verifying weak soundness . . . . . . . . . . . . . . . . . . . 138 7.3.3 Verifying irreducible cancellation regions . . . . . . . . . . 139 7.3.4 Verifying immutable OR-joins . . . . . . . . . . . . . . . . 139 7.4 Illustrating reduction rules . . . . . . . . . . . . . . . . . . . . . . 140 7.4.1 YAWL reduction rules . . . . . . . . . . . . . . . . . . . . 142 7.4.2 Reset reduction rules . . . . . . . . . . . . . . . . . . . . . 144
Page 1: Semantics, Verification, and Implem
Page 4 and 5: Keywords Workflow management, Busin
Page 6 and 7: join semantics has been redefined t
Page 10 and 11: 8 Conclusion 146 Bibliography 147
Page 12 and 13: 3.14 A YAWL net with an OR-join tas
Page 14 and 15: 7.3 A YAWL net for the composite ta
Page 16 and 17: Acknowledgments I would like to exp
Page 18 and 19: Chapter 1. Introduction requirement
Page 20 and 21: Chapter 1. Introduction YAWL provid
Page 22 and 23: Chapter 1. Introduction termine whe
Page 24 and 25: Chapter 1. Introduction 1.9 Alterna
Page 26 and 27: Chapter 1. Introduction of Business
Page 28 and 29: Chapter 2. Formal foundations A res
Page 30 and 31: Chapter 2. Formal foundations The c
Page 32 and 33: Chapter 2. Formal foundations reset
Page 34 and 35: Chapter 2. Formal foundations Notat
Page 36 and 37: Chapter 2. Formal foundations T ′
Page 38 and 39: Chapter 2. Formal foundations Figur
Page 40 and 41: Chapter 2. Formal foundations 2. pr
Page 42 and 43: Chapter 2. Formal foundations Figur
Page 44 and 45: Chapter 2. Formal foundations 2.4 L
Page 46 and 47: Chapter 2. Formal foundations T sta
Page 48 and 49: Chapter 3. OR-join semantics Chapte
Page 50 and 51: Chapter 3. OR-join semantics In gen
Page 52 and 53: Chapter 3. OR-join semantics c1+c3+
Page 54 and 55: Chapter 3. OR-join semantics unfold
Page 56 and 57: Chapter 3. OR-join semantics restri
Page 58 and 59:
Chapter 3. OR-join semantics arrivi
Page 60 and 61:
Chapter 3. OR-join semantics Given
Page 62 and 63:
Chapter 3. OR-join semantics M 1 M
Page 64 and 65:
Chapter 3. OR-join semantics of the
Page 66 and 67:
Chapter 3. OR-join semantics c1+c7
Page 68 and 69:
Chapter 3. OR-join semantics Howeve
Page 70 and 71:
Chapter 3. OR-join semantics t N′
Page 72 and 73:
Chapter 3. OR-join semantics IM(N
Page 74 and 75:
Chapter 3. OR-join semantics nets a
Page 76 and 77:
Chapter 3. OR-join semantics OR-joi
Page 78 and 79:
Chapter 3. OR-join semantics token
Page 80 and 81:
Chapter 4. Verification techniques
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Chapter 5. Reduction rules for RWF-
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Chapter 6. Reduction rules for YAWL
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Chapter 7. Validation Open applican
Page 146 and 147:
Chapter 7. Validation pass pass suf
Page 148 and 149:
Chapter 7. Validation Skills Age En
Page 150 and 151:
Chapter 7. Validation OR-join: Canc
Page 152 and 153:
Chapter 7. Validation does not have
Page 154 and 155:
Chapter 7. Validation the analysis
Page 156 and 157:
Chapter 7. Validation Figure 7.8: S
Page 158 and 159:
Chapter 7. Validation Figure 7.11:
Page 160 and 161:
Chapter 7. Validation Figure 7.14:
Page 162 and 163:
Chapter 8. Conclusion Chapter 8 Con
Page 164 and 165:
[ADK02] [AH00] [AH02] [AH04] [AH05]
Page 166 and 167:
[DJS99] [Eas98] [FRSB02] C. Dufourd
Page 168 and 169:
[PW05] F. Puhlmann and M. Weske. Us
Page 170:
[Whi04] S. White. Process Modeling
show all

Semantics, Verification, and Implementation of Workflows ... - YAWL

Create successful ePaper yourself

Delete template?

Save as template?