On simulation output analysis for generalized semi-Markov processes

Communications in Statistics. Part C: Stochastic Models

Volumn 15, Issue 1, 1999, Pages 53-80

  Haas, Peter J ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Batch means; Discrete event stochastic systems; Generalized semi Markov processes; Markov chains; Regenerative processes; Regenerative simulation; Stability; Standardized time series; Stochastic simulation

Indexed keywords

EID: 0003067005     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326349908807525     Document Type: Article

References (44)

1. Asmussen, S. (1987). Applied Probability and Queues. Wiley, New York.
2. Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
3. Billingsley, P. (1986). Probability and Measure. Wiley, New York.
4. Borovkov, A. A. and Foss, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math. 2, 16-81.
5. Brillinger, D. R. (1973). Estimation of the mean of a stationary time series by sampling. J. Appl. Probab. 10, 419-431.
6. Conway, R. W. (1963). Some tactical problems in digital simulation. Management Sci. 10, 47-61.
7. Crane, M. A. and Iglehart, D. L. (1975). Simulating stable stochastic systems: III, regenerative processes and discrete event simulation. Oper. Res. 23, 33-15.
8. Durrett, R. (1991). Probability: Theory and Examples. Wadsworth and Brooks/Cole, Pacific Grove, CA.
9. Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
10. Fox, B. L. and Glynn, P. W. (1987). Estimating time averages via randomly-spaced observations. SIAM J. Appl. Math. 47, 186-200.
11. Fox, B. L., Goldsman, D., and Swain, J. J. (1991). Spaced batch means. Oper. Res. Lett. 10, 255-263.
12. Glynn, P. W. (1982). Simulation output analysis for general state space Markov chains. Ph.D. Dissertation, Department of Operations Research, Stanford University, Stanford, CA.
13. Glynn, P. W. (1989). A GSMP formalism for discrete event systems. Proc. IEEE 77, 14-23.
14. Glynn, P. W. (1994). Some topics in regenerative steady-state simulation. Acta Appl. Math. 34, 225-236.
15. Glynn, P. W. and Iglehart, D. L. (1988). Simulation methods for queues: An overview. Queueing Systems Theory Appl. 3, 221-256.
16. Glynn, P. W. and Iglehart, D. L. (1990). Simulation output analysis using standardized time series. Math. Oper. Res. 15, 1-16.
17. Glynn, P. W. and Iglehart, D. L. (1993). Conditions for the applicability of the regenerative method. Management Sci. 39, 1108-1111.
18. Glynn, P. W. and Meyn, S. P. (1996). A Lyapunov bound for solutions of Poisson's equation. Ann. Probab. 24, 916-931.
19. Glynn, P. W. and Whitt, W. (1988). Ordinary CLT and WLLN versions of L = λW. Math. Oper. Res. 13, 693-710.
20. Gnedenko, B. V. and Kovalenko, I. N. (1974). Introduction to Queueing Theory. Akademie-Verlag, Berlin, German edn.
21. Goldsman, D., Meketon, M. S., and Shruben, L. W. (1990). Properties of standardized time series weighted area variance estimators. Management Sci 36, 602-612.
22. Haas, P. J. (1985). Recurrence and regeneration in non-Markovian simulations. Ph.D. Dissertation, Department of Operations Research, Stanford University, Stanford, CA.
23. Haas, P. J. and Shedler, G. S. (1985). Regenerative simulation methods for local area computer networks. IBM J. Res. Develop. 29, 194-205.
24. Haas, P. J. and Shedler, G. S. (1987). Recurrence and regeneration in non-Markovian networks of queues. Comm. Statist. Stochastic Models 3, 29-52.
25. Haas, P. J. and Shedler, G. S. (1987). Regenerative generalized semi-Markov processes. Comm. Statist. Stochastic Models 3, 409-438.
26. Haas, P. J. and Shedler, G. S. (1989). Stochastic Petri nets with timed and immediate transitions. Comm. Statist. Stochastic Models 5, 563-600.
27. Haas, P. J. and Shedler, G. S. (1992). Simulation methods for manufacturing systems using stochastic Petri nets. IBM Research Report RJ 8672, IBM Almaden Research Center, San Jose, CA.
28. Iglehart, D. L. and Shedler, G. S. (1983). Simulation of non-Markovian systems. IBM J. Res. Develop. 27, 472-480.
29. Kaspi, H. and Mandelbaum, A. (1992). Regenerative closed queueing networks. Stochastics Stochastics Rep. 39, 239-258.
30. König, D., Matthes, K., and Nawrotzki, K. (1967). Verallgemeinerungen der Erlangschen und Engsetschen Formeln. Akademie-Verlag, Berlin.
31. König, D., Matthes, K., and Nawrotzki, K. (1974). Unempfindlichkeitseigenshaften von Bedienungsprozessen. Appendix to [20].
32. Matthes, K. (1962). Zur Theorie der Bedienungsprozessen. In Trans. 3rd Prague Conf. Inform. Theory Statist. Decision Functions, 39-42.
33. Meyn, S. (1995). Personal communication.
34. Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer-Verlag, London.
35. Meyn, S. P. and Tweedie, R. L. (1993). Stability of Markov processes II: Continuous time processes and sampled chains. Adv. in Appl. Probab. 25, 487-517.
36. Meyn, S. P. and Tweedie, R. L. (1993). Stability of Markov processes III: Foster-Lyapunov criteria for continuous time processes. Adv. in Appl. Probab. 25, 518-548.
37. Muñoz, D. (1991). Multivariate standardized time series in the analysis of simulation output. Tech. Rep. 68, Department of Operations Research, Stanford University, Stanford, CA.
38. Muñoz, D. F. and Glynn, P. W. (1997). A batch means methodology for estimation of a nonlinear function of a steady-state mean. Management Sci. 43, 1121-1135.
39. Schmeiser, B. (1982). Batch size effects in the analysis of simulation output. Oper. Res. 30, 556-568.
40. Shedler, G. S. (1987). Regeneration and Networks of Queues. Springer-Verlag, New York.
41. Shedler, G. S. (1993). Regenerative Stochastic Simulation. Academic Press, New York.
42. Shruben, L. W. (1983). Confidence interval estimation using standardized time series. Oper. Res. 31, 1090-1108.
43. Sigman, K. (1990). Correction: Notes on the stability of closed queueing systems. J. Appl. Probab. 27, 735.
44. Whitt, W. (1980). Continuity of generalized semi-Markov processes. Math. Oper. Res. 5, 494-501.