Automata, Languages and Programming
From MaRDI portal
Publication:5716836
DOI10.1007/11523468zbMath1085.68060WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716836
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
91A43: Games involving graphs
68Q45: Formal languages and automata
91A15: Stochastic games, stochastic differential games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Model Checking Linear-Time Properties of Probabilistic Systems, On Reachability Games of Ordinal Length, Quantitative verification and strategy synthesis for stochastic games, 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, Strategy logic, Verification and control for probabilistic hybrid automata with finite bisimulations, Simple stochastic games with almost-sure energy-parity objectives are in NP and conp, Code aware resource management, Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives, Dicing on the Streett, Graph Games and Reactive Synthesis, Stochastic Games with Finitary Objectives, Decision Problems for Nash Equilibria in Stochastic Games