Algorithms for Omega-Regular Games with Imperfect Information

DOI10.1007/11874683_19zbMath1225.91012OpenAlexW2106923343WikidataQ59446798 ScholiaQ59446798MaRDI QIDQ3613344

Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_19

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives, Looking at mean payoff through foggy windows, Minimum Attention Controller Synthesis for Omega-Regular Objectives, Graph Games and Reactive Synthesis, Compositional and symbolic synthesis of reactive controllers for multi-agent systems, The Effect of Tossing Coins in Omega-Automata, Compositional Control Synthesis for Partially Observable Systems, Latticed-LTL synthesis in the presence of noisy inputs, Model-checking games for logics of imperfect information, Information tracking in games on graphs, A survey of stochastic \(\omega \)-regular games, Timed Control with Observation Based and Stuttering Invariant Strategies, Game-based Synthesis of Distributed Controllers for Sampled Switched Systems, A GENERAL NOTION OF UNIFORM STRATEGIES, Strategy logic, Probabilistic Acceptors for Languages over Infinite Words, Computing Weakest Strategies for Safety Games of Imperfect Information, CEGAR for compositional analysis of qualitative properties in Markov decision processes, Uniform strategies, rational relations and jumping automata