Approximate Throughput Computation of Stochastic Marked Graphs

IEEE Transactions on Software Engineering

Volumn 20, Issue 7, 1994, Pages 526-535

  Campos, Javier ^a   Colom, José Manuel ^a   Silva, Manuel ^a   Jungnitz, Hauke ^b  

^a UNIVERSITY OF ZARAGOZA   (Spain)

^b MERCEDES BENZ AG   (Germany)

Author keywords

functional and performance analysis; iterative response time approximation; marked graphs; Petri net models; structural decomposition

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; QUEUEING THEORY; RANDOM PROCESSES;

FUNCTIONAL AND PERFORMANCE ANALYSIS; ITERATIVE RESPONSE TIME APPROXIMATION; STOCHASTIC MARKED GRAPHS; STRUCTURAL DECOMPOSITION; THROUGHPUT COMPUTATION;

PETRI NETS;

EID: 0028465983     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.297941     Document Type: Article

References (22)

1. S. C. Agrawal, J. P. Buzen, and A. W. Shum, “Response time preservation: A general technique for developing approximate algorithms for queueing networks,” in Proc. 1984 ACM Sigmetrics Conf. on Measurement and Modeling of Comput. Syst., Cambridge. MA, Aug. 1984. pp. 63–77.
2. A. V. Aho, J. E. Hoperoft, and J. D. Ullman. Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
3. M. Ajmone Marsan, G. Balbo, and G. Conte, Performance Models of Multiprocessor Systems. Cambridge, MA: MIT Press, 1986.
4. H. H. Ammar and S. M. R. Islam, “Time scale decomposition of a class of generalized stochastic Petrinet models,” IEEE Trans. Software Eng. vol. 15, no. 6. pp. 809–820. June 1989.
5. F. Baccelli and Z. Liu, “Comparison properties of stochastic decision free Petrinets,” IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1905–1920, Dec. 1992.
6. B. Baynat and Y. Dallery, “Approximate techniques for general closed queueing networks with subnetworks having population constraints.” Tech. Tech. Rep., MASI 90–49. Univ. Paris 6, Paris, France, Oct. 1990.
7. B. Baynat and Y. Dallery, “A unified view of product-form approximation techniques for general closed queueing networks,” Tech. Rep. MASI 90–48. Univ, Paris 6, Paris, France, Oct. 1990.
8. J. Campos, G. Chiola, J. M. Colom, and M. Silva. “Properties and performance bounds for timed marked graphs.” IEEE Trans. Circuits and Syst.--l: Fundamental Theory and Applicat., vol. 39. no. 5. pp. 386–401, May 1992.
9. G. Chiola. “A graphical Petrinet tool for performance analysis,” in Proc. 3rd Int. Workshop on Modeling Tech. and Perform. Eval., AFCET Paris, France, March 1987.
10. G. Ciardo and K. Trivedi, “A decomposition approach for stochastic Petrinets models,” in Proc. 4th Int. Workshop on Petri Nets and Perform. Models, Melbourne, Australia, Dec. 1991, IEEE Comput. Soc. Press. pp. 74–83.
11. J. M. Colom. “Análisis Estructural de Redes de Petri, Programación Lineal y Geometria Convexa,” Ph.D. thesis, Dpto. de Ingeniería Eléctrica e Informática. Univ. Zaragoza. Spain, June 1989.
12. J. M. Colom and M. Silva, “Improving the linearly based characterization of P/T nets,” in Advances in Petri Nets 1990, G. Rozenberg. Ed. Berlin: Springer-Verlag, 1991, vol. 483 of LNCS, pp. 113–145.
13. Y. Dallery, Z. Liu. and D. Towsley, “Equivalence, reversibility and symmetry properties in fork/join queueing networks with blocking.” Tech. Rep., MASI 90–32, Univ. Paris 6, Paris, France. June 1990.
14. A. Desrochers, H. Jungnitz, and M. Silva, “An approximation method for the performance analysis of manufacturing systems based on GSPN’s,” in Proc. Rensselaer’s Third Int. Conf. Comput. Integ. M fg., Troy. NY. May 1992, IEEE Comput. Soc. Press. pp. 46–55,
15. S. Donatelli and M. Sereno, “On the product form solution for stochastic Petrinets,” in Proc. 13th Int. Conf., Applicat. and Theory of Petri Nets Sheffield. UK, June 1992. pp. 154–172.
16. H. Jungnitz. B. Sánchez, and M. Silva, “Approximate throughput computation of stochastic marked graphs.” J. Parallel and Distrib Comput., vol. 15. pp. 282–295, 1992.
17. H. J. Jungnitz, “Approximation Methods for Stochastic |Petri} Nets,” Ph.D. thesis, Dept. of Elec., Comput. and Syst. Eng.,Rensselaer Polytechnic Inst., Troy. NY, May 1992.
18. Y. Li and C. M. Woodside, “Iterative decomposition and aggregation of stochastic marked graphs Petrinets,” in Proc. 12th Int. Conf. on Applicat and Theory of Petri Nets, Gjem, Denmark, June 1991, pp. 257–275.
19. Y. Li and C. M. Woodside, “Performance Petrinet analysis of communications protocol software by delay-equivalent aggregation,” in Proc. 4th Int. Workshop on Petri Nets and Perform. Models, Melbourne, Australia, Dec. 1991, IEEE Comput. Soc. Press, pp. 64–73.
20. R. A. Marie. “An approximate analytical method for general queueing networks,” IEEE Trans. Software Eng., vol. 5. no. 5. pp. 530–538. Sept. 1979.
21. T. Murata. “Petrinets: Properties, analysis, and applications,” Proc. IEEE, vol. 77. no. 4. pp. 541–580, Apr. 1989.
22. M. Silva, Las Redes de Petri en la Automatica y la lnformatica. Madrid: Editorial AC, 1985.