Performability: asymptotic distribution and moment computation

In this paper, we analyze the asymptotic behavior of performability in a Markov reward process. An accurate and numerically stable method is proposed to compute the performability of tail distributions. We derive quite simple, comparatively to known results, recursive formulae for the moments of performability. A numerical example is considered to illustrate the use of our approach.