Concurrent Strategies

Rideau, Silvain; Winskel, Glynn

doi:10.1109/lics.2011.13

Cited by 66 publications

(136 citation statements)

References 14 publications

(28 reference statements)

Supporting

Mentioning

131

Contrasting

Order By: Relevance

“…The main result of [11], presented summarily here, is that two conditions on pre-strategies, receptivity and innocence, are necessary and sufficient for copy-cat to behave as identity w.r.t. the composition of pre-strategies.…”

Section: Strategiesmentioning

confidence: 92%

“…Via Lemma 6, deterministic strategies in a game correspond to certain subfamilies of configurations of the game. A characterisation of those subfamilies which correspond to deterministic strategies [11] shows them to coincide with the receptive ingenuous strategies of Mimram and Melliès [10]. Via the presentation of deterministic strategies as families DGames is equivalent to an order-enriched category.…”

Section: F the Subcategory Of Deterministic Strategiesmentioning

confidence: 94%

“…As a result, in the last decade, a number of games models where the two players can interact concurrently have been proposed. In this paper we study the model developed in [11], a notion of concurrent game based on event structures. Event structures are the concurrency analogue of trees; just as transition systems, an "interleaving" model, unfold to trees so do Petri nets, a "concurrent" model, unfold to event structures.…”

Section: Introductionmentioning

confidence: 99%

“…In [11] concurrent games and strategies were shown to form a bicategory, the aim to establish a new, alternative basis for the semantics of programming languages. Albeit general, the games model introduced in [11] was not equipped with the means to express players' objectives, a feature needed to model several algorithmic problems in areas such as logic and verification. In order to overcome this limitation this paper extends the framework of concurrent games, based on event structures, with winning conditions.…”

Section: Introductionmentioning

confidence: 99%

“…As we will see, the high level of concurrency present in our framework makes the problem very subtle, even for finite games. The paper contains three main technical contributions: firstly, we extend the results of [11] by giving a very general bicategory of concurrent games with winning conditions and nondeterministic winning strategies. Secondly, for well-founded games (i.e.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

The Winning Ways of Concurrent Games

Clairambault

Gutiérrez

Winskel

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract-A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an extension of concurrent games by winning conditions, specifying players' objectives. The introduction of winning conditions raises the question of whether such games are determined, that is, if one of the players has a winning strategy. This paper gives a positive answer to this question when the games are well-founded and satisfy a structural property, race-freedom, which prevents one player from interfering with the moves available to the other. Uncovering the conditions under which concurrent games with winning conditions are determined opens up the possibility of further applications of concurrent games in areas such as logic and verification, where both winning conditions and determinacy are most needed. A concurrent-game semantics for predicate calculus is provided as an illustration.

show abstract

Section: Strategiesmentioning

confidence: 92%

Section: F the Subcategory Of Deterministic Strategiesmentioning

confidence: 94%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

The Winning Ways of Concurrent Games

Clairambault

Gutiérrez

Winskel

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Resource-Tracking Concurrent Games

Alcolei

Clairambault

Olivier

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present a framework for game semantics based on concurrent games, that keeps track of resources as data modified throughout execution but not affecting its control flow. Our leading example is time, yet the construction is in fact parametrized by a resource bimonoid R, an algebraic structure expressing resources and the effect of their consumption either sequentially or in parallel. Relying on our construction, we give a sound resource-sensitive denotation to R-IPA, an affine higherorder concurrent programming language with shared state and a primitive for resource consumption in R. Compared with general operational semantics parametrized by R, our resource analysis turns out to be finer, leading to non-adequacy. Yet, our model is not degenerate as adequacy holds for an operational semantics specialized to time. In regard to earlier semantic frameworks for tracking resources, the main novelty of our work is that it is based on a non-interleaving semantics, and as such accounts for parallel use of resources accurately.

show abstract

Unfolding Symbolic Attributed Graph Grammars

Saadat

Heckel

Orejas

2020

Graph Transformation

View full text Add to dashboard Cite

Attributed graph grammars can specify the transformation of complex data and object structures within a natural rule-based model of concurrency. This is crucial to their use in modelling interfaces of services and components as well as the evolution of complex systems and networks. However, the established concurrent semantics of graph grammars by unfolding does not cover attributed grammars. We develop a theory of unfolding for attributed graph grammars where attribution is represented symbolically, via logical constraints. We establish a functorial representation (a coreflection) of unfolding which guarantees it to be correct, complete and fully abstract. As a case study and running example we demonstrate the use of visual contracts to specify an escrow smart contract.

show abstract

Concurrent Strategies

Cited by 66 publications

References 14 publications

The Winning Ways of Concurrent Games

The Winning Ways of Concurrent Games

Resource-Tracking Concurrent Games

Unfolding Symbolic Attributed Graph Grammars

Contact Info

Product

Resources

About