For the most recent entries see the Petri Nets Newsletter.

Approximate Throughput Computation of Stochastic Marked Graphs.

Campos, J.; Colom, J.M.; Jungnitz, H.; Silva, M.

In: IEEE Transactions on Software Engineering, vol. 20, no. 7, pages 526-535. 1994.

Also in: Baccelli, F.; Jean-Marie, A.; Mitrani, I.: Quantitative Methods in Parallel Systems, Esprit Basic Research Series, pages 175-188. Springer-Verlag, Berlin Heidelberg New York, 1995.

Abstract: A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography