Splitting Long Event Sequences Drawn from Cyclic Processes for Discovering Workflow Nets

Algorithm 2

ReplaceSeq.

Input: S′, σ, θ

Output: S′, θ

1. σ′ ← ∅; start ← 0; end ← 0; first ← 0;

2. ∀ σ_i ∈ S′:

3.  start ← 0

4.  ∀ t_j ∈ σ_i: // tracking the symbols of σ_i

5.   If t_j ∈ (σ) then

6.    If first = 0 then

7.     start ← j; first ← 1;

8.   σ′ ← σ′ ∙ t_j

9.  else

10.   If (σ’) = (σ): //All the tasks in (σ) are in (σ’).

11.    end ← j – 1

12.    θ ← θ ∪ {σ′} //Def. 12. A new sub-trace is appended to the macro-task θ

13.    S′ ← delSet(S′, σ_i, θ, start, end) //Def. 12

         Deletes the tasks in σ_i from start to end and replace them with θ in S′.

14.  else: σ′ ← ∅

15. Return S′, θ