Computer Science Logic
From MaRDI portal
Publication:5292630
DOI10.1007/b13224zbMath1116.68493OpenAlexW2623947920MaRDI QIDQ5292630
Marcin Jurdziński, Krishnendu Chatterjee, 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
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Graph Games and Reactive Synthesis ⋮ Model Checking Probabilistic Systems ⋮ Dicing on the Streett ⋮ Strict Divergence for Probabilistic Timed Automata ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Symbolic control for stochastic systems via finite parity games ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The complexity of stochastic Müller games ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Concurrent reachability games ⋮ Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives ⋮ A survey of partial-observation stochastic parity games ⋮ Reduction of stochastic parity to stochastic mean-payoff games ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Qualitative reachability in stochastic BPA games ⋮ On Reachability Games of Ordinal Length ⋮ Simulation of Relay-Races ⋮ Stochastic Games with Lossy Channels ⋮ Stochastic Müller Games are PSPACE-Complete ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Model-Free Reinforcement Learning for Stochastic Parity Games ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Unnamed Item ⋮ Play to Test ⋮ Qualitative analysis of concurrent mean-payoff games