A general iterative technique for approximate throughput computation of stochastic marked graphs

Proceedings of 5th International Workshop on Petri Nets and Performance Models, PNPM 1993

Volumn , Issue , 1993, Pages 138-147

  Campos, J ^a   Colom, J M ^a   Jungnitz, H ^a   Silva, M ^a  

^a UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; STOCHASTIC SYSTEMS;

APPROXIMATION METHODS; DECOMPOSITION TECHNIQUE; ITERATIVE TECHNIQUE; MARKED GRAPHS; QUALITATIVE BEHAVIOR; SINGLE INPUT SINGLE OUTPUT; STRONGLY CONNECTED;

ITERATIVE METHODS;

EID: 33747366453     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.1993.393427     Document Type: Conference Paper

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. of the 1984 ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, pp. 63-77, Cambridge, MA, Aug. 1984.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
3. M. Ajmone Marsan, G. Balbo, and G. Conte. Performance Models of Multiprocessor Systems. MIT Press, Cambridge, 1986.
4. H. H. Ammar and S. M. R. Islam. Time scale decomposition of a class of generalized stochastic Petri net models. IEEE Trans. Software Eng., 15(6):809-820, June 1989.
5. F. Baccelli and Z. Liu. Comparison properties of stochastic decision free Petri nets. IEEE Trans. Automat. Contr., 37(12): 1905-1920, Dec. 1992.
6. B. Baynat and Y. Dallery. Approximate techniques for general closed queueing networks with subnetworks having population constraints. Tech. report, 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. report, 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.-/: Fundamental Theory and Applications, 39(5):386-401, May 1992.
9. G. Chiola. A graphical Petri net tool for performance analysis. In Proc. of the 3rd Int. Workshop on Modeling Techniques and Performance Evaluation, Paris, France, March 1987. AFCET.
10. G. Ciardo and K. Trivedi. A decomposition approach for stochastic Petri nets models. In Proc. of the 4 th Int. Workshop on Petri Nets and Performance Models, pp. 74-83, Melbourne, Australia, Dec. 1991. IEEE Comput. Soc. Press.
11. J. M. Colom. Andlisis Estructwral de Redes de Petri, Programacidn Lineal y Geometria Convexa. PhD thesis, Dpto. de Ingenieria Electrica e Informatica, Univ. Zaragoza, Spain, June 1989.
12. J. M. Colom and M. Silva. Improving the linearly based characterization of P/T nets. In G. Rozenberg, editor, Advances in Petri Nets 1990, Vol. 483 of LNCS, pp. 113145. Springer-Verlag, Berlin, 1991.
13. Y. Dallery, Z. Liu, and D. Towsley. Equivalence, reversibility and symmetry properties in fork/join queueing networks with blocking. Tech. report, 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. of the Rensselaer's Third Int. Conf. on Computer Integrated Manufacturing, pp. 46-55, Troy, NY, May 1992. IEEE Comput. Soc. Press.
15. S. Donatelli and M. Sereno. on the product form solution for stochastic Petri nets. In Proc. of the 13th Int. Conf. on Applications and Theory of Petri Nets, pp. 154-172, Sheffield, UK, June 1992.
16. H. Jungnitz, B. Sanchez, and M. Silva. Approximate throughput computation of stochastic marked graphs. Journal of Parallel and Distributed Computing, 15:282-295, 1992.
17. H. J. Jungnitz. Approximation Methods for Stochastic Petri Nets. PhD thesis, Dept. of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, May 1992.
18. Y. Li and C. M. Woodside. Iterative decomposition and aggregation of stochastic marked graphs Petri nets. In Proc. of the 12th Int. Conf. on Applications and Theory of Petri Nets, pp. 257-275, Gjern, Denmark, June 1991.
19. Y. Li and C. M. Woodside. Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In Proc. of the 4th Int. Workshop on Petri Nets and Performance Models, pp. 64-73, Melbourne, Australia, Dec. 1991. IEEE Comput. Soc. Press.
20. R. A. Marie. An approximate analytical method for general queueing networks. IEEE Trans. Software Eng., 5(5):530-538, Sep. 1979.
21. T. Murata. Petri nets: Properties, analysis, and applications. Proceedings of the IEEE, 77(4):541-580, April 1989.
22. M. Silva. Las Redes de Petri en la Automdtica y la In-formdtica. Editorial AC, Madrid, 1985.