Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Theoretical Computer Science
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Asynchronous games: innocence without alternation
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Borel determinacy of concurrent games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an extension of concurrent games by winning conditions, specifying players' objectives. The introduction of winning conditions raises the question of whether such games are determined, that is, if one of the players has a winning strategy. This paper gives a positive answer to this question when the games are well-founded and satisfy a structural property, race-freedom, which prevents one player from interfering with the moves available to the other. Uncovering the conditions under which concurrent games with winning conditions are determined opens up the possibility of further applications of concurrent games in areas such as logic and verification, where both winning conditions and determinacy are most needed. A concurrent-game semantics for predicate calculus is provided as an illustration.