Verification and refutation of probabilistic specifications via games
DOI10.4230/LIPICS.FSTTCS.2009.2323zbMATH Open1248.68333OpenAlexW1586832890MaRDI QIDQ2920132FDOQ2920132
Authors: Mark Kattenbelt, Michael Huth 
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2281.html
Recommendations
Markov decision processesprobabilistic model checkingabstraction preorderstochastic two-player games
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Probability and inductive logic (03B48) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Stochastic games, stochastic differential games (91A15)
Cited In (12)
- Abstraction Refinement for Probabilistic Software
- Minimal counterexamples for linear-time probabilistic verification
- Title not available (Why is that?)
- A Note on Game Theory and Verification
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Title not available (Why is that?)
- A game-based abstraction-refinement framework for Markov decision processes
- Tight game abstractions of probabilistic automata
- Automated verification and synthesis of stochastic hybrid systems: a survey
- Title not available (Why is that?)
- Verification of multiplayer stochastic games via abstract dependency graphs
- Modal stochastic games. Abstraction-refinement of probabilistic automata
Uses Software
This page was built for publication: Verification and refutation of probabilistic specifications via games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920132)
