Systems of interacting probabilistic intelligent agents are considered. They have two sources of uncertainty: uncertainty of transfer time in communication channels and uncertainty of results of agent actions. It is shown that behavior of these systems can be effectively simulated by finite Markov chains. So, some known results on complexity of verification of temporal properties of the Markov chains can be transferred to these multi-agent systems.

Programming, parallel computing, multimedia