Research Article

Process Completing Sequences for Resource Allocation Systems with Synchronization

Algorithm 3

Input: ( 𝑁 ξ…ž 𝑅 , 𝑀 0 )
Output: 𝜎 𝑗 β‰  πœ€ such that 𝑀 0 [ 𝜎 𝑗 ⟩ 𝑀 0
Set 𝜎 𝑗 = 𝑑 𝐹 , and fire 𝑑 𝐹
Set 𝑀 𝑗 = 𝑀 0 [ 𝑑 𝐹 ⟩
Loop
 Find 𝑑 ∈ 𝐸 𝑑 ( 𝑀 𝑗 ) s t 𝑀 𝑗 [ 𝑑 ⟩ 𝑀 π‘˜ , 𝑀 βˆ— π‘˜ contains no deadly marked
  siphon
   𝜎 𝑗 = 𝜎 𝑗 𝑑
  If 𝑀 π‘˜ = 𝑀 0 , return reverse ( 𝜎 j )
  Else 𝑀 𝑗 = 𝑀 π‘˜
End Loop