Pages that link to "Item:Q4010366"
From MaRDI portal
The following pages link to Concurrent programs as strategies in games (Q4010366):
Displaying 12 items.
- The variable hierarchy for the games \(\mu \)-calculus (Q636308) (← links)
- Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- Some programming languages suggested by game models (extended abstract) (Q2805154) (← links)
- From parity games to circular proofs (Q2842563) (← links)
- Extracting Winning Strategies in Update Games (Q3091450) (← links)
- Games with Unknown Past (Q4393169) (← links)
- Free \(\mu\)-lattices (Q5960406) (← links)
- Effective strategies for enumeration games (Q6560179) (← links)