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




Related Items

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic TimeGraph Games and Reactive SynthesisModel Checking Probabilistic SystemsDicing on the StreettStrict Divergence for Probabilistic Timed AutomataEfficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component DecompositionSymbolic control for stochastic systems via finite parity gamesA survey of stochastic \(\omega \)-regular gamesThe complexity of stochastic Müller gamesCombinations of Qualitative Winning for Stochastic Parity GamesSimple stochastic games with almost-sure energy-parity objectives are in NP and conpConcurrent reachability gamesSymbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectivesA survey of partial-observation stochastic parity gamesReduction of stochastic parity to stochastic mean-payoff gamesAverage case analysis of the classical algorithm for Markov decision processes with Büchi objectivesQualitative reachability in stochastic BPA gamesOn Reachability Games of Ordinal LengthSimulation of Relay-RacesStochastic Games with Lossy ChannelsStochastic Müller Games are PSPACE-CompleteQualitative Analysis of VASS-Induced MDPsCEGAR for compositional analysis of qualitative properties in Markov decision processesModel-Free Reinforcement Learning for Stochastic Parity GamesExtending Finite-Memory Determinacy by Boolean Combination of Winning ConditionsDecision Problems for Nash Equilibria in Stochastic GamesMeasuring and Synthesizing Systems in Probabilistic EnvironmentsUnnamed ItemPlay to TestQualitative analysis of concurrent mean-payoff games