Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Concurrent Games over Relational Structures: The Origin of Game Comonads (2405.11267v1)

Published 18 May 2024 in cs.LO, cs.PL, and math.CT

Abstract: Spoiler-Duplicator games are used in finite model theory to examine the expressive power of logics. Their strategies have recently been reformulated as coKleisli maps of game comonads over relational structures, providing new results in finite model theory via categorical techniques. We present a novel framework for studying Spoiler-Duplicator games by viewing them as event structures. We introduce a first systematic method for constructing comonads for all one-sided Spoiler-Duplicator games: game comonads are now realised by adjunctions to a category of games, generically constructed from a comonad in a bicategory of game schema (called signature games). Maps of the constructed categories of games are strategies and generalise coKleisli maps of game comonads; in the case of one-sided games they are shown to coincide with suitably generalised homomorphisms. Finally, we provide characterisations of strategies on two-sided Spoiler-Duplicator games; in a common special case they coincide with spans of event structures.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. The pebbling comonad in finite model theory. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1–12. IEEE Computer Society, 2017.
  2. Linear arboreal categories. CoRR, abs/2301.10088, 2023. (to appear in MFPS 2024). URL: https://doi.org/10.48550/arXiv.2301.10088, doi:10.48550/ARXIV.2301.10088.
  3. Relating structure and power: Comonadic semantics for computational resources. J. Log. Comput., 31(6):1390–1428, 2021.
  4. Samson Abramsky afnd Luca Reggio. Arboreal categories: An axiomatic theory of resources. Log. Methods Comput. Sci., 19(3), 2023. URL: https://doi.org/10.46298/lmcs-19(3:14)2023, doi:10.46298/LMCS-19(3:14)2023.
  5. Aurore Alcolei. Enriched concurrent games : witnesses for proofs and resource analysis. (Jeux concurrents enrichis : témoins pour les preuves et les ressources). PhD thesis, University of Lyon, France, 2019. URL: https://tel.archives-ouvertes.fr/tel-02448974.
  6. An optimal lower bound on the number of variables for graph identification. Comb., 12(4):389–410, 1992. doi:10.1007/BF01305232.
  7. Full abstraction for the quantum lambda-calculus. Proc. ACM Program. Lang., 4(POPL):63:1–63:28, 2020. doi:10.1145/3371131.
  8. Concurrent quantum strategies. In Michael Kirkedal Thomsen and Mathias Soeken, editors, Reversible Computation - 11th International Conference, RC 2019, Lausanne, Switzerland, June 24-25, 2019, Proceedings, volume 11497 of Lecture Notes in Computer Science, pages 3–19. Springer, 2019. doi:10.1007/978-3-030-21500-2\_1.
  9. Game semantics for quantum programming. Proc. ACM Program. Lang., 3(POPL):32:1–32:29, 2019. doi:10.1145/3290345.
  10. The winning ways of concurrent games. In LICS 2012: 235-244, 2012.
  11. John Conway. On Numbers and Games. Wellesley, MA: A K Peters, 2000.
  12. Lovász-type theorems and game comonads. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021, pages 1–13. IEEE, 2021.
  13. Partial orders, event structures and linear strategies. In TLCA ’09, volume 5608 of LNCS. Springer, 2009.
  14. Finite Model Theory and Its Applications. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2007. URL: https://doi.org/10.1007/3-540-68804-8.
  15. Concurrent strategies on games with algebras, M1 Internship report, ENS Paris-Saclay, 2024. arXiv:2402.04590.
  16. Andre Joyal. Remarques sur la théorie des jeux à deux personnes. Gazette des sciences mathématiques du Québec, 1(4), 1977.
  17. Bisimulation from open maps. Inf. Comput., 127(2):164–185, 1996.
  18. A game-theoretic approach to constraint satisfaction. In Henry A. Kautz and Bruce W. Porter, editors, Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30 - August 3, 2000, Austin, Texas, USA, pages 175–181. AAAI Press / The MIT Press, 2000. URL: http://www.aaai.org/Library/AAAI/2000/aaai00-027.php.
  19. The pebble-relation comonad in finite model theory. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’22, New York, NY, USA, 2022. Association for Computing Machinery.
  20. Hugo Paquet. Probabilistic concurrent game semantics. PhD thesis, Computer Laboratory, University of Cambridge, UK, 2020.
  21. D Park. A new equivalence notion for communicating systems. Bulletin EATCS, 14:78–80, 1981.
  22. Concurrent strategies. In LICS 2011, 2011.
  23. Bertrand Russell. Introduction to mathematical philosophy (The Muirhead library of philosophy). HarperCollins Publishers Ltd, 1919.
  24. Dana Scott. Identity and existence. In Applications of sheaves, Proceedings of the Research Symposium on Applications of Sheaf Theory to Logic, Algebra, and Analysis, Durham, July 9–21,1977, volume 753 of Lecture Notes in Mathematics, page 660–696. Springer, 1979.
  25. R.H. Street. The formal theory of monads. J. Pure Appl. Algebra, 2:149–168, 1972.
  26. R. J. van Glabbeek. The linear time - branching time spectrum. In J. C. M. Baeten and J. W. Klop, editors, CONCUR ’90 Theories of Concurrency: Unification and Extension, pages 278–297, Berlin, Heidelberg, 1990. Springer Berlin Heidelberg.
  27. Glynn Winskel. Events in computation. 1980. PhD thesis, University of Edinburgh.
  28. Glynn Winskel. Event structure semantics for CCS and related languages. In ICALP’82, volume 140 of LNCS. Springer, A full version is available from Winskel’s Cambridge homepage, 1982.
  29. Glynn Winskel. Event structures with symmetry. In Luca Cardelli, Marcelo Fiore, and Glynn Winskel, editors, Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, volume 172 of Electronic Notes in Theoretical Computer Science, pages 611–652. Elsevier, 2007.
  30. Glynn Winskel. Deterministic concurrent strategies. Formal Asp. Comput., 24(4-6):647–660, 2012.
  31. Glynn Winskel. Winning, losing and drawing in concurrent games with perfect or imperfect information. In Festschrift for Dexter Kozen, volume 7230 of LNCS. Springer, 2012.
  32. Glynn Winskel. Distributed probabilistic and quantum strategies. Electr. Notes Theor. Comput. Sci. 298: 403-425, 2013.
  33. Glynn Winskel. Strategies as profunctors. In FOSSACS 2013, Lecture Notes in Computer Science. Springer, 2013.
  34. Glynn Winskel. ECSYM Notes: Event Structures, Stable Families and Concurrent Games. http://www.cl.cam.ac.uk/∼similar-to\sim∼gw104/ecsym-notes.pdf, 2016.
  35. Glynn Winskel. Making concurrency functional. In LICS, pages 1–14, 2023. doi:10.1109/LICS56636.2023.10175727.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now