Automatic Verification of Competitive Stochastic Systems.

Journal article

We present automatic verification techniques for the modelling and analysis of probabilistic systems that incorporate competitive behaviour. These systems are modelled as turn-based stochastic multi-player games, in which the players can either collaborate or compete in order to achieve a particular goal. We define a temporal logic called rPATL for expressing quantitative properties of stochastic multi-player games. This logic allows us to reason about the collective ability of a set of players to achieve a goal relating to the probability of an event's occurrence or the expected amount of cost/reward accumulated. We give a model checking algorithm for verifying properties expressed in this logic and implement the techniques in a probabilistic model checker, based on the PRISM tool. We demonstrate the applicability and efficiency of our methods by deploying them to analyse and detect potential weaknesses in a variety of large case studies, including algorithms for energy management and collective decision making for autonomous systems. © 2012 Springer-Verlag Berlin Heidelberg.

Authors: Chen, T; Forejt, V; Kwiatkowska, M; Parker, D; Simaitis, A

• Publication status: Published
• Publisher: Springer
• Journal: TACAS
• Volume: 7214
• Pages: 315-330
• Publication date: 2012-01-01
• DOI: 10.1007/978-3-642-28756-5_22
• EISSN: 1611-3349
• ISSN: 0302-9743
• Language: English