Immediate Events in Markov Chains
Immediate events are events which happen without delay. There are several contexts in which immediate events occur. In particular, they are important for formulating Markovian systems efficiently, they are an integral part of generalised stochastic Petri nets, and they are useful for analysing processes which have different time scales. These applications are reviewed, and a unified theory for finding equilibrium probabilities for such processes is developed. This theory is based on the GTH algorithm, which is augmented by a special algebra.
Unable to display preview. Download preview PDF.
- Berson, S., De Souza e Silva, E., Muntz, R. R. 1991. A Methodology for the Specification and Generation of Markov Models. in: W. J. Stewart (editor), Numerical Solutions of Markov Chains, Marcel Dekker, New York, 11–36.Google Scholar
- Grassmann, W. K. 1991. Finding Transient Solutions in Markovian Event Systems Through Randomization. In: W. J. Stewart (editor), Numerical Solutions of Markov Chains, Marcel Dekker, New York, 357–371.Google Scholar
- O’Leary, D. and Yuan-Jye, J.W. 1993. A Block GTH Algorithm for Finding the Stationary Vector of a Markov Chain Preprint.Google Scholar
- Stewart, W. J. 1991. MARCA: Markov Chain Analyzer. A Software Package for Markov Modelling. In: W. J. Stewart (editor), Numerical Solutions of Markov Chains, Marcel Dekker, New York, 37–62. Google Scholar
- Wallace, V. L. and Rosenberg, R. S. 1966. RQA-1. The Recursive Queue Analyser. Technical Report, System Eng. Lab, University of Michigan, Ann Arbor.Google Scholar