On properties of multi-agent systems with probabilistic communication channels
Abstract:
It is shown as a multi-agent system with probabilistic communication channels can be translated to a finite Markov chain. This permits to transfer known results on computational complexity of verifying dynamic properties of Markov chains to multi-agent systems with probabilistic channels.
