Approximate mean value analysis for stochastic marked graphs

IEEE Transactions on Software Engineering

Volumn 22, Issue 9, 1996, Pages 654-664

  Sereno, Matteo ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Approximate mean value analysis algorithm; Approximation techniques; Computational algorithms; Marked graphs; Stochastic petri nets

Indexed keywords

EID: 0007625778     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.541436     Document Type: Article

References (31)

1. VI. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte, and A. Cumani, "The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets/' IEEE Trans. Software Eng., vol. 15, no. 7, pp. 832-846, July 1989.
2. G. Balbo, S.C. Bruell, and M. Sereno, "Arrival Theorems for Product-Form Stochastic Petri Nets," Prac. 79.94 S1CMETRICS ConJ., Nashville, Tenn., May 1994.
3. Y. Bard. "Some Extensions to Multiclass Queuing Network Analysis," Performance of Computers, M. Arato, A. Butrimenko, and E. Gelenbe, eds. North-Holland, 1979.
4. F. Baskett, K.M. Chandy, R.R. Munt-4, and F. Palacios. "Open, Closed and Mixed Networks of Queues With Different Classes of Customers," J. ACM, vol. 22, no. 2, pp. 248-260, Apr. 1975.
5. R.J. Boucherie and M. Sereno, "On the Traffic Equations for Batch Routing Queuing Networks and Stochastic Petri Nets," Technical Report KKC1M-04/94-R032, European Research Consortium for Informatics and Mathematics, 1994.
6. P. Buchholtz and P. Kemper, "Numerical Analysis of Stochastic Marked Graph Nets," Proc. Sixth luf'l Workshop on Petri Nets and Performance Models, Durham, N.C., Oct., 1995.
7. J. Campos, G. Chiola, and M. Suva, "Ergodidty and Throughput Bounds for Petri Nets With Unique Consistent Firing Count Vector," IEEE Tram. Software Eng., vol. 17, no. 2, pp. 117-125, Feb. 1991.
8. J. Campos, C. Chiola, and M. Suva, "Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queuing Networks," IEEE Trans. Automatic Control, vol. 36, no. 12, pp. 1,368-1,382, Dec. 1991.
9. J. Cdmpus/ J.M. Colony H. Jungnifz, and M. Silva, "A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs," Prcc. Fifth Int'l Workshop on Petri Nets and Performance Models, Toulouse, France, Oct. 1993.
10. K.M. Chandy, U. Herzog, and L.S. Woo, "Approximate Analysis of General Queuing Networks," IBM }. Research and Development, vol. 19, no. 1, pp. 43-49, Jan. 1975.
11. K.M. Chandy and D. Neuse. "Linearizer: A Heuristic- Algorithm for Queuing Network Models of Computing Systems," Comm. ACM, vol. 25, no. 2, pp. 126-134, Feb. 1982.
12. G. Chiola, G. Franceschinis, R. Gaeta, and VI. Ribaudo, "GreatSPNl.7: GRaphical Editor and Analyzer for Timed and Stochastic Petri Nets," Performance Evaluation, Special issue on Performance Modeling Tools, Nov. 1995.
13. J.L. Coleman, W. Henderson, and P.G. Taylor, "Product Form Equilibrium Distributions and an Algorithm fur Classes of Batch Movement Queuing Networks and Stochastic Petri Nets," Technical report, Univ. of Adelaide, 1992.
14. A.J. Coyle, W. Henderson, C.E.M. Pearce, and P.G. Taylor, "A General Formulation for the Mean-Value Analysis in Product Form Batch-Movement Queuing Networks," Queuing Systems, vol. 16, pp. 363-372,1994.
15. J. Desel and J. Esparza, "Reachability in Reversible Free-Choice Systems, Technical Report TUM-I9Ü23, Inst Für Informatik, 1990.
16. M. Di Mascolo, M.Y. Frein, Y. Dallery, and R. David, "Modeling of Kanban Systems Using Petri Nets," P roc. Third ORSA/TLMS Conf. on Flexible Manufacturing Systems, North Holland: Elsevier Science 1989.
17. G. Florin and S. Natkin, "Les reseaux de Petri stochastiques," Technique et Science Informatiques, vol. 4, no. 1, Feb. 1985.
18. W.J. Gordon and G.F. Newell, "Closed Queuing Systems With Exponential Servers," OperaHons Research, vol. 15, pp. 254-265,1967.
19. W. Henderson, D. Lucie, and P.G. Taylor, "A Net Level Performance Analysis of Stochastic Petri Nets," J. Australian Math. Soc. Scries B, vol. 31, pp. 176-187,1989.
20. W. Henderson and P.G. Taylor, "Embedded Processes in Stochastic Petri Nets," IEF.F Trans. Software Eng., vol. 17, pp. 108-116, Feb.1991.
21. J.R. Jackson, "Jobshop-Likc Queuing Systems," Management Science, vol. 10, no. 1, pp. 131-142, Oct. 1963.
22. A. Jungnitz, II. Desrochers, and M. Suva, "Approximation Techniques for Stochastic Macroplace /Macrotransition Nets," Proc. QMIPS Workshop Stochastic Petri Nets, pp. 118-146, Sophia Antipolis, France, Nov. 1992.
23. Y. Li and C.M. Woodsidc, "Iterative Decomposition and Aggrc gation of Stochastic Marked Graphs," Proc. 12th Int'l Conf. Application and Theory of Pelri Nels, Gjern, Denmark, June 1991.
24. J.D.C. Little, "A Proof of the Queuing Formula / = AID," Operations Research, vol. 9, pp. 383-387,1961.
25. M.K. Molloy, "Performance Analysis Using Stochastic Pctri Nets,." ILLL Trans. Computers, vol. 31, no. 9. pp. 913-917, Sept. 1982.
26. T. Murata, "Petri Nets: Properties, Analysis, and Applications," Proc. IEEE, vol. 77, no. 4, pp. 541-580, Apr. 1989.
27. K.R. Pattipati, M.M. Kostreva, and J.L. Teele, "Approximate Mean Value Analysis Algorithms of Queuing Networks: Existence, Uniqueness and Convergence Results," J. ACM, vol. 3, pp. 643673, Jan. 1990.
28. PJ. Schweitzer, "A Survey of Mean Value Analysis, Its Generalizations, and Applications, for Networks of Queues," Technical Report, Univ. of Rochester, Rochester, N.Y., Dec. 1990.
29. M. Sereno and G. Balbo. Mean Value Analysis of Stochastic Petri Nets," Performance Evaluation, to appear.
30. M. Sereno and G. Balbo, "Computational Algorithms for Product Form Solution Stochastic Petri Nets," Proc. Fifth Int'l Workshop on Petri Nets and Performance Models, Toulouse, France, Oct. 1993.
31. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom, and M. Suva. "On the Weighted T-Systems," Application and Theory of Petri Nets 1992, Proc. 13th Int'l Conf., LNCS, no. 616, Sheffield, England, June 1992.