The generalized semi-Markov process (GSMP) is the usual model for the underlying stochastic process of a complex discrete-event stochastic system. Strong laws of large numbers (SLLNs) and functional central limit theorems (FCLTs) give basic conditions under which such processes exhibit stable long run behavior. These limit theorems also provide approximations for cumulative-reward distributions, confidence intervals for statistical estimators, and efficiency criteria for simulation algorithms. We prove an SLLN and FCLT for finite state GSMPs under significantly weaker conditions on the moments of the clock-setting distributions than have previously been imposed. As part of our analysis, we use Lyapunov-function arguments to show that finite moments for new clock readings imply finite moments for the od-regenerative cycles of both the GSMP and its underlying general state space Markov chain.
By: Peter W. Glynn, Peter J. Haas
Published in: RJ10315 in 2003
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .