Web Services Conversation Adaptation Using Conditional Substitution Semantics of Application Domain Concepts

Algorithm 3

Sequence mediator procedure (SMP).

Input: 𝑆[𝑖] (the 𝑖th source state), 𝑇[𝑗] (the 𝑗th target

state), 𝐺 (the required goal)

Output: Return true when sequences re-clustering is finished.

(1)  Begin

(2)  if (𝑆[𝑖]⊵_𝐺𝑇[𝑗]) then

(3)    Apply Algorithm 3 over (𝑆[𝑖], 𝑇[𝑗], 𝐺)

(4)  else

(5)    if (𝑆[𝑖]⇓_𝐺𝑇[𝑗]) then

(6)    Expand 𝑆[𝑖]

(7)    Apply Algorithm 3 over (𝑆[𝑖], 𝑇[𝑗], 𝐺)

(8)    else

(9)    if (𝑆[𝑖]⇑_𝐺𝑇[𝑗]) then

(10)     Apply CRO over 𝑆[𝑖]

(11)      Apply Algorithm 3 over (𝑆[𝑖], 𝑇[𝑗], 𝐺)

(12)   else

(13)     BackTrack = 𝑆[𝑖]

(14)     if (𝑗<‖𝑇[]‖) then

(15)      if (𝑖<‖𝑆[]‖) then

(16)       Apply Algorithm 4 over (𝑆[𝑖+1], 𝑇[𝑗], 𝐺)

(17)      else

(18)       if (𝑇[𝑗]⇑_𝐺𝑆[𝑖]) then

(19)       Apply CRO over 𝑇[𝑗]

(20)      Apply Algorithm 3 over (𝑆[𝑖], 𝑇[𝑗], 𝐺)

(21)       else

(22)       Mark 𝑇[𝑗] as Unmatched

(23)       Apply Algorithm 4 over (BackTrack,

        𝑇[𝑗+1], 𝐺)

(24)      end if

(25)      end if

(26)     else

(27)      Merge unmatched source states with their

       predecessors.

(28)      Return true

(29)     end if

(30)  end if

(31)   end if

(32) end if

(33) End