A Mathematical Game Semantics of Concurrency and Nondeterminism
Concurrent games as event structures form a partial order model of concurrency where concurrent behaviour is captured by nondeterministic concurrent strategies—a class of maps of event structures. Extended with winning conditions, the model is also able to give semantics to logics of various kinds. An interesting subclass of this game model is the one considering deterministic strategies only, where the induced model of strategies can be fully characterised by closure operators. The model based on closure operators exposes many interesting mathematical properties and allows one to define connections with many other semantic models where closure operators are also used. However, such a closure operator semantics has not been investigated in the more general nondeterministic case. Here we do so, and show that some nondeterministic concurrent strategies can be characterised by a new definition of nondeterministic closure operators which agrees with the standard game model for event structures and with its extension with winning conditions.
KeywordsConcurrent games Event structures Closure operators
I thank Paul Harrenstein, Glynn Winskel, and Michael Wooldridge for their comments and support. Also, I acknowledge with gratitude the support of the ERC Advanced Research Grant 291528 (“RACE”) at Oxford.
- 3.Abramsky, S., Melliès, P.: Concurrent games and full completeness. In: LICS, pp. 431–442. IEEE Computer Society (1999)Google Scholar
- 4.Berry, G.: Modèles complètement adéquats et stables des lambda-calculs typés. Ph.D. thesis, University of Paris VII (1979)Google Scholar
- 5.Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games. In: LICS, pp. 235–244. IEEE Computer Society (2012)Google Scholar
- 8.Harmer, R., Hyland, M., Melliès, P.: Categorical combinatorics for innocent strategies. In: LICS, pp. 379–388. IEEE Computer Society (2007)Google Scholar
- 10.Kahn, G., Plotkin, G.: Concrete domains. Technical report, INRIA (1993)Google Scholar
- 13.Nielsen, M., Winskel, G.: Models for concurrency. In: Handbook of Logic in Computer Science, pp. 1–148. Oxford University Press (1995)Google Scholar
- 14.Olarte, C., Valencia, F.D.: Universal concurrent constraint programing: symbolic semantics and applications to security. In: SAC, pp. 145–150. ACM (2008)Google Scholar
- 16.Rideau, S., Winskel, G.: Concurrent strategies. In: LICS, pp. 409–418. IEEE Computer Society (2011)Google Scholar
- 17.Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: POPL, pp. 333–352. ACM Press (1991)Google Scholar