An Optimize Algorithm for Path Probabilities in Stochastic Process Algebras

Nondeterminism in a stochastic process algebras (SPA) is resolved by a scheduler. For given scheduler D and a starting state, D induces a stochastic process MD on an SPA M. In this paper, by definition the path probability and using dynamic programming method of mathematic on a induced stochastic process algebras MD, we give an algorithm to compute the optimize path probability to reach a set of goal states within a time bound on SPA from the start state s
₀
and analysis the complexity of our algorithm.