Computer Science Logic

DOI10.1007/b13224zbMath1116.68493MaRDI QIDQ5292630

Krishnendu Chatterjee, Marcin Jurdziński, Thomas A. Henzinger

Publication date: 21 June 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13224

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A43: Games involving graphs

91A15: Stochastic games, stochastic differential games

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

On Reachability Games of Ordinal Length, Stochastic Games with Lossy Channels, Stochastic Müller Games are PSPACE-Complete, Measuring and Synthesizing Systems in Probabilistic Environments, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Qualitative reachability in stochastic BPA games, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Reduction of stochastic parity to stochastic mean-payoff games, Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives, A survey of partial-observation stochastic parity games, Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives, Qualitative analysis of concurrent mean-payoff games, Dicing on the Streett, Concurrent reachability games, Qualitative Analysis of VASS-Induced MDPs, Strict Divergence for Probabilistic Timed Automata, Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition, Play to Test, Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time, Decision Problems for Nash Equilibria in Stochastic Games