First passage times for multidimensional denumerable state Markov processes

For a general multidimensional denumerable state Markov process with any initial state probability vector, the probability density function and its LS transform of the first passage time to a certain given state set are obtained and the algorithms for them are derived. It is proved that the resulting errors of the algorithms are both uniform in their respective arguments. Some numerical results are presented.