Dayar, Tuǧrul2016-02-082016-02-08200597835402870181611-3349http://hdl.handle.net/11693/27288Conference name: European Performance Engineering Workshop, EPEW 2005 and International Workshop on Web Services and Formal Methods, WS-FM 2005Date of Conference: 1-3 September 2005Recently, 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.EnglishComputational complexityComputer scienceMarkov processesDiscrete phase-typeDiscrete-time Markov chains (DTMCs)Test suiteSet theoryConference Paper10.1007/11549970_510.1007/11549970