Automated Verification of Concurrent Stochastic Games
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Authors
Colleges, School and Institutes
External organisations
- University of Oxford
- University of Glasgow
Abstract
We present automatic verification techniques for concurrent stochastic multi-player games (CSGs) with rewards. To express properties of such models, we adapt the temporal logic rPATL (probabilistic alternating-time temporal logic with rewards), originally introduced for the simpler model of turn-based games, which enables quantitative reasoning about the ability of coalitions of players to achieve goals related to the probability of an event or reward measures. We propose and implement a modelling approach and model checking algorithms for property verification and strategy synthesis of CSGs, as an extension of PRISM-games. We evaluate the performance, scalability and applicability of our techniques on case studies from domains such as security, networks and finance, showing that we can analyse systems with probabilistic, cooperative and competitive behaviour between concurrent components, including many scenarios that cannot be analysed with turn-based models.
Details
Original language | English |
---|---|
Title of host publication | Proceedings of the 15th International Conference on Quantitative Evaluation of SysTems (QEST'18). |
Publication status | Published - 15 Aug 2018 |
Event | 15th International Conference on Quantitative Evaluation of SysTems (QEST'18) - Beijing, China Duration: 4 Sep 2018 → 7 Sep 2018 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 15th International Conference on Quantitative Evaluation of SysTems (QEST'18) |
---|---|
Country | China |
City | Beijing |
Period | 4/09/18 → 7/09/18 |