We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Robotics & Automation/PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time
Conference ProceedingsRobotics & Automation

PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time

Checking your access to this record.

Abstract & Overview

We present a major new release of the PRISM-games model checker, featuring multiple significant advances in its support for verification and strategy synthesis of stochastic games. Firstly, concurrent stochastic games bring more realistic modelling of agents interacting in a concurrent fashion. Secondly, equilibria-based properties provide a means to analyse games in which competing or collaborating players are driven by distinct objectives. Thirdly, a real-time extension of (turn-based) stochastic games facilitates verification and strategy synthesis for systems where timing is a crucial aspect. This paper describes the advances made in the tool’s modelling language, property specification language and model checking engines in order to implement this new functionality. We also summarise the performance and scalability of the tool, and describe a selection of case studies, ranging from security protocols to robot coordination, which highlight the benefits of the new features.

Cite this record

Marta Kwiatkowska, Gethin Norman, David Parker, Gabriel Santos (2020). PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time. Lecture notes in computer science. https://doi.org/10.1007/978-3-030-53291-8_25

Copy in another style

Kwiatkowska, M., Norman, G., Parker, D., & Santos, G. (2020). PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time. Lecture notes in computer science. https://doi.org/10.1007/978-3-030-53291-8_25
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.