The reaction of a cyber-physical system to a stimulus typically requires the processing of several tasks. A task in this context is an aggregation of different working steps, where each step comprises a dedicated piece of software called runnable. The delay between stimulus and reaction depends of the interaction of the software pieces and is subject to timing constraints. Therefore, tight bounds on the delays are needed at any stage of the engineering processes. We present an extension for an approach to estimate such bounds more precisely than previously possible.