Abstract
Recently, an efficient and stable method to compute moments of first passage times from a subset of states classified as safe to the other states in ergodic discrete-time Markov chains (DTMCs) has been proposed. This paper shows that the same method can be used to compute moments of discrete phase-type (DPH) distributions, analyzes its complexity on various acyclic DPH (ADPH) distributions, and presents results on a set of DPH distributions arising in a test suite of DTMCs. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Dayar, T. (2005). On moments of discrete phase-type distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3670 LNCS, pp. 51–63). https://doi.org/10.1007/11549970_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
