Infinite games and verification (Extended abstract of a tutorial)
From MaRDI portal
Recommendations
Cited in
(21)- Almost compatible functions and infinite length games
- Weak observable liveness and infinite games on finite graphs
- Modular strategies for recursive game graphs
- Conway games, coalgebraically
- Equivalences and congruences on infinite Conway games
- Reachability games on automatic graphs
- Extracting winning strategies in update games
- scientific article; zbMATH DE number 5954365 (Why is no real title available?)
- The mu-calculus and Model Checking
- A Dynamic Algorithm for Reachability Games Played on Trees
- Measuring Permissivity in Finite Games
- A Note on Game Theory and Verification
- Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
- scientific article; zbMATH DE number 1231521 (Why is no real title available?)
- Symbolic bounded synthesis
- Algorithms: From Al-Khwarizmi to Turing and Beyond
- Nash equilibria in games over graphs equipped with a communication mechanism
- Visibly pushdown modular games
- Finite high-order games and an inductive approach towards Gowers's dichotomy
- Subgame optimal strategies in finite concurrent games with prefix-independent objectives
- Infinite Games, Inductive Definitions and Transfinite Recursion
This page was built for publication: Infinite games and verification (Extended abstract of a tutorial)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804886)