Return
Performability analysis: A new algorithm
DOI:10.1109/12.494108.png)
Abstract
En 中文
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.
Keywords:
fault tolerance
repairable systems
Markov processes
performability
performance
reliability
uniformization
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
no more

