Stochastic games with lexicographic reachability-safety objectives

DOI10.1007/978-3-030-53291-8_21zbMath1478.68151arXiv2005.04018OpenAlexW3046820103MaRDI QIDQ2226751

Tobias Winkler, Krishnendu Chatterjee, Maximilian Weininger, Joost-Pieter Katoen

Publication date: 9 February 2021

Full work available at URL: https://arxiv.org/abs/2005.04018

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (4)

Symbolic verification and strategy synthesis for turn-based stochastic games ⋮ Unnamed Item ⋮ Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations ⋮ Comparison of algorithms for simple stochastic games

This page was built for publication: Stochastic games with lexicographic reachability-safety objectives