Zobrazeno 1 - 10
of 335
pro vyhledávání: '"Winskel, Glynn"'
Autor:
Montacute, Yoàv, Winskel, Glynn
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
Externí odkaz:
http://arxiv.org/abs/2405.11267
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 Player and O
Externí odkaz:
http://arxiv.org/abs/2402.04590
Autor:
Winskel, Glynn
The article bridges between two major paradigms in computation, the functional, at basis computation from input to output, and the interactive, where computation reacts to its environment while underway. Central to any compositional theory of interac
Externí odkaz:
http://arxiv.org/abs/2202.13910
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 in their
Externí odkaz:
http://arxiv.org/abs/2108.10558
Autor:
de Visme, Marc, Winskel, Glynn
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 2 (April 20, 2023) lmcs:6202
In the simplest form of event structure, a prime event structure, an event is associated with a unique causal history, its prime cause. However, it is quite common for an event to have disjunctive causes in that it can be enabled by any one of multip
Externí odkaz:
http://arxiv.org/abs/2003.06267
Publikováno v:
Selecta Mathematica - New Series, 24 (3), 2018, pp. 2791-2830
We introduce the notion of a relative pseudomonad, which generalises the notion of a pseudomonad, and define the Kleisli bicategory associated to a relative pseudomonad. We then present an efficient method to define pseudomonas on the Kleisli bicateg
Externí odkaz:
http://arxiv.org/abs/1612.03678
Autor:
de Visme, Marc, Winskel, Glynn
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 strategies
Externí odkaz:
http://arxiv.org/abs/1607.03747
Autor:
Winskel, Glynn
A summary of work on distributed games and strategies done within the first three years of the ERC project ECSYM is presented.
Externí odkaz:
http://arxiv.org/abs/1607.03760
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 3 (September 29, 2017) lmcs:3966
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Ridea
Externí odkaz:
http://arxiv.org/abs/1604.04390
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 1 (March 4, 2019) lmcs:3891
We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong
Externí odkaz:
http://arxiv.org/abs/1409.7542