Performability analysis: a new algorithm

DOI10.1109/12.494108zbMath1048.68543OpenAlexW2129091052MaRDI QIDQ4420951

Bruno Sericola, Hédi Nabli

Publication date: 1996

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.494108

zbMATH Keywords

reliabilityMarkov processesuniformizationfault tolerancerepairable systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization. ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization ⋮ Stationary analysis of a fluid queue driven by some countable state space Markov chain ⋮ Performability: Asymptotic distribution and moment computation ⋮ Performability analysis for degradable computer systems ⋮ Moments' analysis in homogeneous Markov reward models ⋮ Performability measure for acyclic Markovian models

This page was built for publication: Performability analysis: a new algorithm