Approximate Throughput Computation of Stochastic Weighted T-Systems

A general iterative technique for approximate throughput computation of stochastic live and bounded weighted T-systems (WTS) is presented. It generalizes a previous technique on stochastic marked graphs. The approach has two basic foundations. First, a deep understanding of the qualitative behavior of WTS leads to a general decomposition technique. Second, after the decomposition phase, an iterative response-time approximation method is applied for the throughput computation. Existence of convergence points for the iterative approximation method can be proved. Experimental results generally have an error of less than 5%. The state space is usually reduced by more than one order of magnitude; therefore, the analysis of otherwise intractable systems is possible