Verification and refutation of probabilistic specifications via games
From MaRDI portal
Publication:2920132
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)
Recommendations
Cited in
(12)- Minimal counterexamples for linear-time probabilistic verification
- Abstraction Refinement for Probabilistic Software
- scientific article; zbMATH DE number 1617325 (Why is no real title available?)
- A Note on Game Theory and Verification
- Game-Based Probabilistic Predicate Abstraction in PRISM
- A game-based abstraction-refinement framework for Markov decision processes
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Automated verification and synthesis of stochastic hybrid systems: a survey
- Tight game abstractions of probabilistic automata
- scientific article; zbMATH DE number 2090706 (Why is no real title available?)
- Verification of multiplayer stochastic games via abstract dependency graphs
- Modal stochastic games. Abstraction-refinement of probabilistic automata
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)
