A probabilistic automaton is an automatic device, controlled by a set of special instructions and intended for realizing a given statistically stable random behavior of output parameters. Probabilistic computations have several adavantages over deterministic ones. The paper lists possible methods and tools for speeding up the computation or modelling processes. The properties of probabilistic processors or their networks are defined by the characteristics of the corresponding probabilistic automaton model. Different approaches to automata synthesis are described.

Probabilistic automaton, probabilistic computations, probabilistic processor, networks

Mathematical problems and theory of numerical methods