.png){kind=icon}
Return
Comment on Performability Analysis: A New Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2009.114.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper Performability Analysis: A New Algorithm describes an algorithm for computing the complementary distribution of the accumulated reward over an interval of time in a homogeneous Markov process. In this comment, we show that in two particular cases, one of which is quite frequent, small modifications of the algorithm may reduce significantly its storage complexity.
Keywords:
Fault tolerance
repairable systems
Markov processes
performability
performance
reliability
uniformization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave