“…The abstraction transition tY 2 has four scheduling sequences: ρ1 = t2t3t5t4, ρ2 = t3t2t5t4, ρ3 = t3t4t2t5, and ρ4 = t3t2t4t5. Using the algorithm of [12,13], we know that the execution time of four scheduling sequences is respectively (3,4), (3,5), (3,5), and (3,5). Therefore, So we may set that the scheduling length of the abstraction transition is (3,5).…”