Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Events, Causality and Symmetry
The Computer Journal
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
Bicategories of concurrent games
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Distributed Probabilistic and Quantum Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Nondeterministic concurrent strategies--those strategies compatible with copy-cat behaving as identity w.r.t. composition--have been characterised as certain maps of event structures. This leads to a bicategory of general concurrent games in which the maps are nondeterministic concurrent strategies. This paper explores the consequences of extending concurrent games with (1) winning, losing and, implicitly, neutral configurations, and (2) access levels, to address situations where Player or Opponent have imperfect information as to what has occurred in the game. In both cases winning strategies are shown to form bicategories of games. The bicategories become equivalent to order-enriched categories when restricted to deterministic strategies.