Step 1: Identify the Set of All Tasks
TW={A,B,C,D,E,F,K}
Step 2: Identify the Execution sequences
Case 1: A → B → D → E → F → K
Case 2: A → B → D → F → E → K
Case 3: A → C → D → E → F → K
Case 4: A → C → D → F → E → K
Step 3: Identify Direct successor
We analyse the log to determine the direct successor:
• A >w B, A >w C
• B >w D, C >w D
• D >w E, D >w F
• E >w F, E >w K
• F >w E, F >w K
Step 4: Identify Causality, Concurrency, and Exclusive Relations
Based on the directly- successor relations, we identify the different types of relationships:
1. Causality:
o A → B, A → C
o B → D, C → D
o D → E, D → F
o E → K, F → K
2. Concurrency (E ∥ F)
3. Exclusiveness:
o Activities that do not appear in succession or causally related (e.g., A and K, B
and C) are exclusive.
Step 5: Identify Patterns
• Pattern (1): Simple causality (e.g., A → B and A → C).
• Pattern (2): XOR-split when one activity leads to multiple, mutually exclusive paths
(A → (B # C) due to the Exclusiveness between B and C.).
• Pattern (3): AND-split when one activity leads to multiple, mutually concurrent paths
(D → (E ∥ F) due to the concurrency between E and F.).
Step 6: Final Process Model Structure
• A as the starting task, branching to B or C (XOR-split)
• XOR-join before D after B and C
• AND-split after D for E and F to represent their concurrency
• AND-join after E and E, then it leads to K