Before revision:  To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus framework, and consist in analyzing locally the delay upper bound in each crossed node, resulting in pessimistic end-to-end delay bounds . Hence, the main contribution in this paper is enhancing the delay bounds tightness of such networks, through an innovative global analysis based on Network Calculus, accounting the flow serialization phenomena along the flow path .
After revision:  To cope with this arising issue of cyclic dependencies, only few techniques have been proposed in the literature, mainly based on Network Calculus . First, we review the conventional timing approaches in the area and identify their main limitations, in terms of delay bounds pessimism. Afterwards, we have introduced a new concept called Pay Multiplexing Only at Convergence points (PMOC) to overcome such limitations. PMOC considers the flow serialization phenomena along the flow path .