Transient Solution of Acyclic Markov Chains.
Abstract
Continuous time Markov chains are commonly used in system reliability modeling. Increasing system complexity and non-Markovian behavior can drastically increase the size of a Markov model's state space. Special approximation techniques and numerical methods have been introduced to reduce the resources needed to solve Markov chain models. This paper discusses a method for automatically deriving exact transient solutions of Markov chains. The solutions derived are symbolic in t. The authors' approach can also provide solutions that are symbolic in other parameters. They extend our method to include parametric sensitivity analysis of the transient solution, and to provide cumulative measures of Markov chain behavior. They present three examples, one to show the use of our method in evaluating approximate solution techniques, one showing parametric sensitivity analysis of a large Markov model, and one demonstrating the computation of cumulative measures for an acyclic Markov reward processes. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1985
- Accession Number
- ADA162314
Entities
People
- Andrew Reibman
- Kishor Trivedi
- Raymond Marie
Organizations
- Duke University