Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-26T22:31:54.418Z Has data issue: false hasContentIssue false
  • English
  • Français

Estimating the Mean Cover Time of a Semi-Markov Process via Simulation

Published online by Cambridge University Press:  27 July 2009

Erol Peköz  and
Sheldon M. Ross
Erol Peköz
Affiliation:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, California 94720
Sheldon M. Ross
Affiliation:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, California 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

An efficient simulation estimator of the expected time until all states of a finite state semi-Markov process have been visited is determined.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 11 , Issue 2 , April 1997 , pp. 267 - 271
Copyright
Copyright © Cambridge University Press 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Matthews, P. (1988). Covering problems for Markov chains. Annals of Probability 16: 1215–1228.CrossRefGoogle Scholar
2.Ross, S.M. (1997). Simulation, 2nd ed.New York: Academic Press.Google ScholarPubMed