Issue No. 04 - April (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.494108
<p><b>Abstract</b>—We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of he algorithm.</p>
Fault tolerance, repairable systems, Markov processes, performability, performance, reliability, uniformization.
H. Nabli and B. Sericola, "Performability Analysis: A New Algorithm," in IEEE Transactions on Computers, vol. 45, no. , pp. 491-494, 1996.