Comment on "Performability analysis: a new 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 mo...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/19938 |
| Acceso en línea: | https://hdl.handle.net/2117/19938 https://dx.doi.org/10.1109/TC.2009.114 |
| Access Level: | acceso abierto |
| Palabra clave: | Fault-tolerant computing Markov processes Tolerància als errors (Informàtica) Markov, Processos de Àrees temàtiques de la UPC::Matemàtiques i estadística::Estadística matemàtica |
| Sumario: | 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. |
|---|