Total Flow Analysis (TFA) is a method for conducting the worst-case analysis of time sensitive networks without cyclic dependencies. In networks with cyclic dependencies, Fixed-Point TFA introduces artificial cuts, analyses the resulting cycle-free network with TFA, and iterates. If it converges, it does provide valid performance bounds. We show that the choice of the specific cuts used by Fixed-Point TFA does not affect its convergence nor the obtained performance bounds, and that it can be replaced by an alternative algorithm that does not use any cut at all, while still applying to cyclic dependencies.

翻译：总体流动分析(TFA)是对没有周期依赖性的时间敏感网络进行最坏的个案分析的一种方法,在有周期依赖性的网络中,固定点TFA引入人为削减,分析由此产生的与TFA的无周期网络,以及外延。如果它相趋同,它确实提供了有效的性能界限。我们表明,选择固定点TFA使用的具体削减并不影响其趋同或获得的性能界限,它可以被完全不使用任何削减的替代算法所取代,同时仍然适用于周期依赖性。