ls3-www.cs.tu-dortmund.de/cms/medien/publikationen/EM-1996.pdf
1), (W), (3,3), (494) WA GQ, (3,319 (794) 1
{W), CW, (6,319 (7,411 {W), (W, C&3), (7,411 {(4,1), WA (6,3), (7,4)1
Fiaure 2
16
Proceedings of the 8th Euromicro Workshop on Real-Time Systems 1068-3070/96 [...] sequences of blockages, so-called worst-case blocking sequences. As the next step we developed in [4] an efficient algorithm for finding all possible blocking sequences between the global operation paths [...] global operation path by another one. Examples explain the main result. In section 2 the algorithm from [4] is described which, for two given global operation paths po and pt, computes all possible blocking …