Authors: Lozovanu Dmitrii, Alexandru Lazari
– 0.15 Mb
Abstract
A new approach for determining the matrix of limiting state probabilities in Markov processes is proposed and a polynomial time algorithm for calculating this matrix is grounded. The computational complexity of the algorithm is O(n4) where n is the number of the states of the discrete system.E-mail: ,
Fulltext
– 0.15 Mb
