A computationally efficient technique for transient analysis of repairable Markovian systems

DOI10.1016/0166-5316(94)00033-6zbMath0876.60073OpenAlexW2070747054WikidataQ126670761 ScholiaQ126670761MaRDI QIDQ3122496

Manish Malhotra

Publication date: 27 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(94)00033-6

zbMATH Keywords

Markov chainsStabilityReliabilityRunge-Kutta-Fehlberg methodfailure ratesTransient analysisOrdinary differential equationsRepairable systemsrepair ratesStiffnessAvailabilityPerformabilityDependability

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (6)

Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization. ⋮ A Generalized Method for the Transient Analysis of Markov Models of Fault-Tolerant Systems with Deferred Repair ⋮ Implicit ODE solvers with good local error control for the transient analysis of Markov models ⋮ Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization ⋮ Reliability Bounds for Fault-Tolerant Systems with Deferred Repair using Bounding Split Regenerative Randomization ⋮ Computing reliability indices of repairable systems via signature

Uses Software

• TR-BDF2

This page was built for publication: A computationally efficient technique for transient analysis of repairable Markovian systems