Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
DOI10.1007/BF01919287zbMATH Open0618.90094OpenAlexW1972578359MaRDI QIDQ3755251FDOQ3755251
Publication date: 1986
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01919287
Recommendations
- Accurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains
- Computing Moments of First Passage Times to a Subset of States in Markov Chains
- Computing mean first passage times for a Markov chain
- Numerical Methods in Markov Chain Modeling
- Numerical Solution of Linear Equations Arising in Markov Chain Models
numerical computationstationary distributionstate reductionabsorption probabilitiesMarkov and semi-Markov modelsmean passage times
Markov renewal processes, semi-Markov processes (60K15) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Markov Renewal Processes with Finitely Many States
- Markov renewal theory
- Markov Renewal Processes: Definitions and Preliminary Properties
- Title not available (Why is that?)
- The Factorization of Queueing Equations and Their Interpretation
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Random sets and fuzzy interval analysis
- Accurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains
- State reduction in a Markov decision process
- Computing absorption probabilities for a Markov chain
- Computing mean first passage times for a Markov chain
- The computation of key properties of Markov chains via perturbations
- Mapping absorption processes onto a Markov chain, conserving the mean first passage time
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- The computation of the mean first passage times for Markov chains
This page was built for publication: Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755251)