Industrial Automatic Control Systems and Controllers Annotation << Back The Method of Directed Search of Distribution Series for the Binary Markov’s Chains Simulation Tasks D.L. Belyaev V.I. Bliznyuk V.A. Ivanov M.Yu. Konyshev S.V. Kharchenko The article describes the characteristics of binary Markov’s chains representing dependencies of the binary different lengths vectors probabilities. The article gives a description of analytic expressions allowing the calculation of dependencies limits for the multidimensional binary random quantities probabilities intervals from the values of binary random quantities probabilities of less dimension. The authors show the reason for including the «rejection» procedure for the process of Markov’s binary random sequences simulation which allows detecting nonergodic binary sequences. The authors suggest the method for directed enumeration of distribution series of the Markov’s binary sequences probabilities. This method generates only ergodic binary random sequences and removes the «rejection» procedure from the simulation process. The article explains the developed algorithm that has less computational complexity than the well-known algorithms for computation experiment organization to research the statistical characteristics of the random binary sequences in systems. Keywords: Markov chains; binary sequences; simulation; binary vector probabilities; discrete random quantity. Contacts: E-mail: v_bliznyuk@mail.ru, E-mail:misha-kon@mail.ru, E-mail: xksv@mail.ru Pp. 47-51.