Automatic verification of competitive stochastic systems

Chen, Taolue, Forejt, Vojtěch, Kwiatkowska, Marta, Parker, David and Simaitis, Aistis (2013) Automatic verification of competitive stochastic systems. Formal Methods in System Design, 43 (1). pp. 61-92. ISSN 0925-9856

Full text is not in this repository.

Abstract

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 an algorithm for verifying properties expressed in this logic and implement the techniques in a probabilistic model checker, as an extension of 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 in Microgrids and collective decision making for autonomous systems.

Item Type: Article
Keywords (uncontrolled): Quantitative verification, Probabilistic model checking, Stochastic multi-player games, Probabilistic temporal logic
Research Areas: A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 12036
Depositing User: Users 3197 not found.
Date Deposited: 25 Sep 2013 14:14
Last Modified: 11 Jun 2019 13:16
URI: https://eprints.mdx.ac.uk/id/eprint/12036

Actions (login required)

Edit Item Edit Item