About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Regenerative Generalized Semi-Markov Processes
Abstract
A generalized semi-Markov process (GSMP) is the usual model for a discrete event simulation. the standard formulation assumes that the current state of the process uniquely determines the set of events that are scheduled to occur and that the state transition probabilities depend only on the current state, the next state, and the trigger event. We provide a formulation of a GSMP that avoids these restrictions, thus permitting formal specification of many non-Markovian simulation models. Using a monotone replacement property of“new better than used” distributions and sample path properties of the GSMP, we provide a criterion for recurrence in this setting and conditions under which a GSMP is a regenerative process and the time between regeneration points has finite moments. Steady state estimation methods for non-Markovian stochastic network simulations follow. © 1987, Taylor & Francis Group, LLC. All rights reserved.