Труды V Международной научно-практической конференции.'Интегрированные модели и мягкие вычисления в искусственном интеллекте', т.1. М., Физматлит, 2009, 198-206
Complexity of verification of multi-agent systems with probabilistic states and programs
Abstract:
In earlier papers we have shown that systems of interacting intelligent agents with probabilistic communication channels and actions can be simulated by some finite Matrkov chains. Here we generalize this result to systems of agents which in addition have probabilistic states and control programs, too.This permits to generalize results on verification of behavior of probabilistic multi-agent systems.
