On the determinacy of concurrent games on event structures with infinite winning sets
DOI10.1016/J.JCSS.2014.04.005zbMATH Open1291.03067OpenAlexW2120885238MaRDI QIDQ2453582FDOQ2453582
Authors: Julian Gutiérrez, Glynn Winskel 
Publication date: 10 June 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.005
Recommendations
Applications of game theory (91A80) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Alternating-time temporal logic
- Borel determinacy
- The winning ways of concurrent games
- A survey of stochastic \(\omega \)-regular games
- The determinacy of Blackwell games
- Title not available (Why is that?)
- Concurrent reachability games
- Bisimulation, modal logic and model checking games
- Concurrent logic games on partial orders
Cited In (7)
- Automated synthesis of distributed controllers
- The winning ways of concurrent games
- Borel determinacy of concurrent games
- Weak observable liveness and infinite games on finite graphs
- The determinacy of infinite games with eventual perfect monitoring
- STACS 2004
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
This page was built for publication: On the determinacy of concurrent games on event structures with infinite winning sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453582)
