Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68089OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716837

Mihalis Yannakakis, Kousha Etessami

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

Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (17)

Hyperplane separation technique for multidimensional mean-payoff games ⋮ The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements ⋮ Graph Games and Reactive Synthesis ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ A survey of stochastic \(\omega \)-regular games ⋮ The complexity of stochastic Müller games ⋮ Equilibria, fixed points, and complexity classes ⋮ Reachability in recursive Markov decision processes ⋮ Approximating the Termination Value of One-Counter MDPs and Stochastic Games ⋮ Regularity in PDA Games Revisited ⋮ Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems ⋮ Qualitative reachability in stochastic BPA games ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Stochastic Games with Lossy Channels ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ A note on the attractor-property of infinite-state Markov chains ⋮ Qualitative analysis of concurrent mean-payoff games

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