Randomness for Free
From MaRDI portal
Publication:3586088
DOI10.1007/978-3-642-15155-2_23zbMath1287.91027arXiv1006.0673OpenAlexW2569902747MaRDI QIDQ3586088
Krishnendu Chatterjee, Hugo Gimbert, Laurent Doyen, Thomas A. Henzinger
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0673
2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (13)
What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Accurate approximate diagnosis of (controllable) stochastic systems ⋮ Graph Games and Reactive Synthesis ⋮ Supervisor synthesis of POMDP via automata learning ⋮ Parameter-Independent Strategies for pMDPs via POMDPs ⋮ Unnamed Item ⋮ Probabilistic opacity for Markov decision processes ⋮ A survey of partial-observation stochastic parity games ⋮ Partial-Observation Stochastic Games ⋮ Random Measurable Selections ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Unnamed Item ⋮ POMDPs under probabilistic semantics
This page was built for publication: Randomness for Free
