Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68060OpenAlexW2940595899WikidataQ56656999 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

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (16)

Graph Games and Reactive Synthesis ⋮ Dicing on the Streett ⋮ Stochastic Games with Finitary Objectives ⋮ Quantitative verification and strategy synthesis for stochastic games ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The complexity of stochastic Müller games ⋮ 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 ⋮ Strategy logic ⋮ Qualitative reachability in stochastic BPA games ⋮ On Reachability Games of Ordinal Length ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Decision Problems for Nash Equilibria in Stochastic Games

This page was built for publication: Automata, Languages and Programming