Admissible Strategies in Infinite Games over Graphs
From MaRDI portal
Publication:3182935
DOI10.1007/978-3-642-03816-7_27zbMath1250.68187OpenAlexW1523747463MaRDI QIDQ3182935
Publication date: 16 October 2009
Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_27
Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Shield synthesis ⋮ Assume-admissible synthesis ⋮ Unnamed Item ⋮ Synthesizing adaptive test strategies from temporal logic specifications ⋮ A game-theoretic approach for the synthesis of complex systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Code aware resource management
- Alternating-time temporal logic
- Admissibility in Infinite Games
- On the synthesis of strategies in infinite games
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Admissible Strategies in Infinite Games over Graphs