Calculating availability and performability measures of repairable computer systems using randomization
From MaRDI portal
Recommendations
- Interval availability analysis using operational periods
- scientific article; zbMATH DE number 3978222
- scientific article; zbMATH DE number 1008393
- Performability measure for acyclic Markovian models
- A dependability measure for Markov models of repairable systems: Solution by randomization and computational experience
Cited in
(12)- Markov and Markov reward model transient analysis: An overview of numerical approaches
- Numerical analysis of gracefully degrading fault-tolerant computer systems: Semi-Markov and Laguerre transform approach
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
- Analysis of inhomogeneous Markov reward models
- Performability analysis for degradable computer systems
- A dependability measure for Markov models of repairable systems: Solution by randomization and computational experience
- Analysis of R out of N systems with several repairmen, exponential life times and phase type repair times: an algorithmic approach
- Scalable, adaptable, and fast estimation of transient downtime in virtual infrastructures using convex decomposition and sample path randomization
- Computing bounds on steady state availability of repairable computer systems
- Exact decomposition approaches for Markov decision processes: a survey
- Four Canadian Contributions to Stochastic Modeling
- Specification techniques for Markov reward models
This page was built for publication: Calculating availability and performability measures of repairable computer systems using randomization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814521)
