ls3-www.cs.tu-dortmund.de/cms/en/publications/WeW96/index.html
[WeW96] - Chair 3 - Department of Computer Science - TU Dortmund
execution paths of subprograms t0,t1,...,tn where a given path of t o experiences a worst-case blocking time caused by a scenario of operations on execution paths of t1,...,tn, due to such operations blocking [...] determining all possible worst-case blocking scenarios of an execution path of to by execution paths of t1,...,tn . While this problem is NP-hard we give a polynomial algorithm for an associated (reduced) problem …