Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of actions. We show how such systems can be polynomially transformed to finite state Markov chains. This allows to transfer known results on verifying temporal properties of the finite state Markov chains to the probabilistic multi-agent systems of considered type.

Programming, parallel computing, multimedia