Verification and refutation of probabilistic specifications via games
From MaRDI portal
abstraction preorderMarkov decision processesprobabilistic model checkingstochastic two-player games
Modal logic (including the logic of norms) (03B45) Probability and inductive logic (03B48) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Stochastic games, stochastic differential games (91A15)
Recommendations
Cited in
(12)- Automated verification and synthesis of stochastic hybrid systems: a survey
- Verification of multiplayer stochastic games via abstract dependency graphs
- scientific article; zbMATH DE number 1617325 (Why is no real title available?)
- Tight game abstractions of probabilistic automata
- A Note on Game Theory and Verification
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Abstraction Refinement for Probabilistic Software
- Minimal counterexamples for linear-time probabilistic verification
- scientific article; zbMATH DE number 2090706 (Why is no real title available?)
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- Game-Based Probabilistic Predicate Abstraction in PRISM
- A game-based abstraction-refinement framework for Markov decision processes
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)
