Verifying team formation protocols with probabilistic model checking
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Automatic verification of competitive stochastic systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
In many situations an agent's behaviour can sensibly be described only in terms of a distribution of probability over a set of possibilities. In such case (agents') decision-making becomes probabilistic too. In this work we consider a probabilistic variant of a well-known (two-players) Negotiation game and we show, first, how it can be encoded into a Markovian model, and then how a probabilistic model-checker such as PRISM can be used as a tool for its (automated) analysis. This paper is meant to exemplify that verification through model-checking can be fruitfully applied also to uncertain multi-agent systems. This, in our view, is the first step towards the characterisation of an automated verification method for probabilistic agents.