Performability analysis: a new algorithm
Hédi Nabli, Bruno Séricola · IEEE Transactions on Computers · 1996
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 the algorithm.