We propose, ifl 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.
—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… (More)
We investigate the asymptotic workload distribution of fluid models with input and output rates which are modulated by an irreducible Markov process. An analytical solution is proposed in [H. Nabli, Asymptotic solution of stochastic fluid models, Perform. Eval. 57 (2004) 121_140] for general Markov fluid model. This probability distribution is controlled by… (More)