On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
Probabilistic systems of interacting nondeterministic intelligent agents are consid- ered. States of the agents in these systems are some probabilistic databases, and the activity of the agents is controlled by some probabilistic logic programs. Moreover, com- munication channels between agents are also probabilistic. We show how such systems can be polynomially transformed to ¯nite state Markov decision processes. This allows one to transfer the known results on verifying temporal properties of the ¯nite state Markov processes to the probabilistic multi-agent systems of considered type.