English
Related papers

Related papers: Games and Strategies as Event Structures

200 papers

In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on event structures. However there are limitations in founding…

Logic in Computer Science · Computer Science 2016-07-14 Marc de Visme , Glynn Winskel

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…

Logic in Computer Science · Computer Science 2025-06-17 Yoàv Montacute , Glynn Winskel

Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…

Computer Science and Game Theory · Computer Science 2024-02-08 Sacha Huriot-Tattegrain , Glynn Winskel

Causality plays an important role in daily processes, human reasoning, and artificial intelligence. There has however not been much research on causality in multi-agent strategic settings. In this work, we introduce a systematic way to…

Artificial Intelligence · Computer Science 2025-02-20 Sylvia S. Kerkhove , Natasha Alechina , Mehdi Dastani

We show that a category of causal contextuality scenarios with no cycles, unique causal bridges, and causally secured covers is equivalent to a category containing a subclass of the formerly published spacetime games, which generalize game…

Quantum Physics · Physics 2025-06-16 Ghislain Fourny

Concurrent strategies based on event structures are examined from the viewpoint of 'may' and 'must' testing in traditional process calculi. In their pure form concurrent strategies fail to expose the deadlocks and divergences that can arise…

Logic in Computer Science · Computer Science 2021-08-25 Simon Castellan , Pierre Clairambault , Glynn Winskel

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

Logic in Computer Science · Computer Science 2010-11-05 Julian Gutierrez

We study categories for reversible computing, focussing on reversible forms of event structures. Event structures are a well-established model of true concurrency. There exist a number of forms of event structures, including prime event…

Logic in Computer Science · Computer Science 2017-04-12 Eva Graversen , Iain Phillips , Nobuko Yoshida

Two families of denotational models have emerged from the semantic analysis of linear logic: dynamic models, typically presented as game semantics, and static models, typically based on a category of relations. In this paper we introduce a…

Logic in Computer Science · Computer Science 2025-10-29 Pierre Clairambault , Federico Olimpieri , Hugo Paquet

Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…

Logic in Computer Science · Computer Science 2026-03-03 Clément Aubert , Jean Krivine

One of the well-known results in concurrency theory concerns the relationship between event structures and occurrence nets: an occurrence net can be associated with a prime event structure, and vice versa. More generally, the relationships…

Logic in Computer Science · Computer Science 2019-10-25 Hernán Melgratti , Claudio Antares Mezzina , Iain Phillips , G. Michele Pinna , Irek Ulidowski

This is a short introduction to the subject of strategic games. We focus on the concepts of best response, Nash equilibrium, strict and weak dominance, and mixed strategies, and study the relation between these concepts in the context of…

Computer Science and Game Theory · Computer Science 2011-02-02 Krzysztof R. Apt

The present paper gives a mathematical, in particular, syntax-independent, formulation of intensionality and dynamics of computation in terms of games and strategies. Specifically, we give a game semantics for a higher-order programming…

Logic in Computer Science · Computer Science 2021-02-10 Norihiro Yamada , Samson Abramsky

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…

Logic in Computer Science · Computer Science 2009-08-28 Samuel Mimram

In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling's bisimulation games. If…

Formal Languages and Automata Theory · Computer Science 2012-06-29 Shibashis Guha , Shankara Narayanan Krishna

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…

Logic in Computer Science · Computer Science 2011-01-27 Samuel Mimram

Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…

Combinatorics · Mathematics 2019-05-03 Nicholas Ham

There are many different models of concurrent processes. The goal of this work is to introduce a common formalized framework for current research in this area and to eliminate shortcomings of existing models of concurrency. Following up the…

Logic in Computer Science · Computer Science 2008-03-24 Mark Burgin a , Marc L. Smith

In the development of operational semantics of concurrent systems, a key decision concerns the adoption of a suitable notion of execution model, which basically amounts to choosing a class of partial orders according to which events are…

Formal Languages and Automata Theory · Computer Science 2024-07-19 Maciej Koutny , Lukasz Mikulski

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

Computer Science and Game Theory · Computer Science 2020-04-01 Joseph Abdou , Nikolaos Pnevmatikos , Marco Scarsini , Xavier Venel
‹ Prev 1 2 3 10 Next ›