Automata, Languages and Programming
From MaRDI portal
Publication:5716837
DOI10.1007/11523468zbMath1085.68089WikidataQ56656999 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
91A15: Stochastic games, stochastic differential games
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Regularity in PDA Games Revisited, Stochastic Games with Lossy Channels, 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, Qualitative reachability in stochastic BPA games, Reachability in recursive Markov decision processes, A note on the attractor-property of infinite-state Markov chains, Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems, Qualitative analysis of concurrent mean-payoff games, Hyperplane separation technique for multidimensional mean-payoff games, Recursive Markov Decision Processes and Recursive Stochastic Games, Qualitative Analysis of VASS-Induced MDPs, Approximating the Termination Value of One-Counter MDPs and Stochastic Games, The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements, Graph Games and Reactive Synthesis