Skip to main content
Log in

Numerically Stable Methods for the Computation of Exit Rates in Markov Chains

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

We consider the exit rate from a finite class of transient states of a continuous-time Markov chain and develop numerically stable methods for the computation with bounded from above approximation error of the steady-state exit rate and the time-dependent exit rate. Finally, we develop an also numerically stable method for the computation with bounded from above approximation error of reachable bounds for the time-dependent exit rate which are independent of the initial probability distribution. Applications for the latter include the cyclic analysis of fault-tolerant systems and the analysis of fault-tolerant systems with unobservable up state. The methods compare well from a computational cost point of view with existing alternatives, some with inferior quality regarding error control.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Arlat J, Laprie JC (1983) Performance-related dependability evaluation of supercomputer systems. In: Proc. 13rd IEEE annual symp. on fault-tolerant computing. Los Alamitos, IEEE Computer Society Press, pp 276–283

    Google Scholar 

  • Berman A, Plemmons RJ (1994) Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • Byrne GD, Hindmarsh AC (1975) A polyalgorithm for the numerical solution of ordinary differential equations. ACM Trans Math Softw 1:71–96

    Article  MathSciNet  MATH  Google Scholar 

  • Carrasco JA (2003) Markovian dependability/performability modeling of fault-tolerant systems. In: Pham H (ed) Handbook of reliability engineering. Springer, New York, pp 613–652

    Chapter  Google Scholar 

  • Carrasco JA (2004) Transient analysis of some rewarded Markov models using randomization with quasistationarity detection. IEEE Trans Comput 53:1106–1120

    Article  Google Scholar 

  • Cohen SD, Hindmarsh AC (1996) CVODE, a stiff/nonstiff ODE solver in C. Comput Phys 10:138–143

    Article  Google Scholar 

  • Courtois JP (1977) Decomposability: queuing and computer system applications. Academic Press, New York

    MATH  Google Scholar 

  • Darroch JN, Seneta E (1965) On Quasi-stationary Distributions in Absorbing Discrete-time Finite Markov Chains. J Appl Probab 2:88–100

    Article  MathSciNet  MATH  Google Scholar 

  • Darroch JN, Seneta E (1967) On Quasi-stationary Distributions in Absorbing Continuous-time Finite Markov Chains. J Appl Probab 4:192–196

    Article  MathSciNet  MATH  Google Scholar 

  • Fousse L, Hanrot G, Lefvre V, Plissier P, Zimmermann P (2007) MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans Math Softw 33:1–15

    Article  MathSciNet  Google Scholar 

  • Fox BL, Glynn PW (1988) Computing Poisson Probabilities. Commun ACM 31:440–5

    Article  MathSciNet  Google Scholar 

  • Ghasemi A, Yacout S, Ouali MS (2010) Evaluating the reliability function and the mean residual life for equipment with unobservable states. IEEE Trans Reliab 59:45–54

    Article  Google Scholar 

  • Gross D, Miller DR (1984) The randomization technique as a modeling tool and solution procedure for transient Markov processes. Oper Res 32:343–361

  • Higham NJ (2002) Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia

    Book  MATH  Google Scholar 

  • (1985) IEEE standard for binary floating-point arithmetic, IEEE Computer Society Press, Los Alamitos

  • Kijima M (1997) Markov processes for stochastic modeling. Chapman & Hall, London

    Book  MATH  Google Scholar 

  • Knüsel L (1986) Computation of the Chi-square and Poisson Distribution. SIAM J Sci Stat Comput 7:1022–1036

    Article  MathSciNet  MATH  Google Scholar 

  • Moorsel AP, Sanders WH (1997) Transient solution of Markov models by combining adaptive and standard uniformization. IEEE Trans Reliab 46:430–440

  • Rubino G, Sericola B (1989) Sojourn times in finite Markov processes. J Appl Probab 27:744–756

    Article  MathSciNet  MATH  Google Scholar 

  • Rubino G (1997) Predicting dependability properties on-line. In: Proc. 16th symp. on reliable distributed systems. IEEE Computer Society Press, Los Alamitos, pp 53–9

    Google Scholar 

  • Schott JR (1997) Matrix analysis for statistics. Wiley, New York

    MATH  Google Scholar 

  • Seneta E (2006) Non-negative matrices and Markov chains. Springer, New York

    MATH  Google Scholar 

  • Sismail K (1991) A software tool for fault-tolerant systems in the operational phase. In: Proc. IFAC/IFIP/ENICS/SR.lstems, pp 47–55

  • Van Der Vorst HA (1992) Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J Sci Stat Comput 13:631–644

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan A. Carrasco.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Carrasco, J.A. Numerically Stable Methods for the Computation of Exit Rates in Markov Chains. Methodol Comput Appl Probab 18, 307–334 (2016). https://doi.org/10.1007/s11009-014-9417-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-014-9417-4

Keywords

AMS 2000 Subject Classification

Navigation