Characterizing positionality in games of infinite duration over infinite graphs
From MaRDI portal
Publication:6649452
DOI10.1145/3531130.3532418MaRDI QIDQ6649452
Publication date: 6 December 2024
Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the positional determinacy of edge-labeled games
- Interpolation of functions over a measure space and conjectures about memory
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Playing Safe
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Half-Positional Determinacy of Infinite Games
- The Theory of Universal Graphs for Infinite Duration Games
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Positional Determinacy of Games with Infinitely Many Priorities
- Solving Sequential Conditions by Finite-State Strategies
- Stochastic Games
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Characterizing positionality in games of infinite duration over infinite graphs
