Information tracking in games on graphs
From MaRDI portal
Publication:616037
DOI10.1007/s10849-009-9115-8zbMath1203.91033MaRDI QIDQ616037
Dietmar Berwanger, Łukasz Kaiser
Publication date: 7 January 2011
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-009-9115-8
Related Items
Uniform strategies, rational relations and jumping automata, Distributed Synthesis in Continuous Time, Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus, Consensus Game Acceptors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of two-player games of incomplete information
- Distributed synthesis for well-connected architectures
- Infinite games played on finite graphs
- The infimal prefix-closed and observable superlanguage of a given language
- Undecidable problems of decentralized observation and control on regular languages
- Algorithms for Omega-Regular Games with Imperfect Information
- Supervisory Control of a Class of Discrete Event Processes
- Alternation
- Think globally, act locally: decentralized supervisory control
- On the synthesis of strategies in infinite games