Probabilistic Systems with LimSup and LimInf Objectives
DOI10.1007/978-3-642-03092-5_4zbMATH Open1258.68099OpenAlexW1624593473MaRDI QIDQ3644792FDOQ3644792
Authors: Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 12 November 2009
Published in: Infinity in Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03092-5_4
Recommendations
Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43)
Cited In (8)
- Qualitative analysis of VASS-induced MDPs
- Percentile queries in multi-dimensional Markov decision processes
- Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Limit synchronization in Markov decision processes
- Stochastic shortest paths and weight-bounded properties in Markov decision processes
- Mixing probabilistic and non-probabilistic objectives in Markov decision processes
- A Survey of Stochastic Games with Limsup and Liminf Objectives
This page was built for publication: Probabilistic Systems with LimSup and LimInf Objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644792)