Distributed Strategies Made Easy
From MaRDI portal
Publication:5111299
DOI10.4230/LIPIcs.MFCS.2017.81zbMath1441.68143OpenAlexW2773523332MaRDI QIDQ5111299
Glynn Winskel, Simon Castellan, Pierre Clairambault
Publication date: 26 May 2020
Full work available at URL: https://hal.archives-ouvertes.fr/hal-01886946
Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- On concurrent games with payoff
- Distributed probabilistic and quantum strategies
- Strategies as concurrent processes
- Non-angelic concurrent game semantics
- Event Structures with Symmetry
- Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information
- The Winning Ways of Concurrent Games
- Asynchronous Games: Innocence Without Alternation
- Some reasons for generalising domain theory
- Partial Orders, Event Structures and Linear Strategies
- Causality vs. interleavings in concurrent game semantics
- Nondeterminism in Game Semantics via Sheaves
- Strategies as Profunctors
- Games and Strategies as Event Structures
- Probabilistic and Quantum Event Structures
- Profunctors, open maps and bisimulation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distributed Strategies Made Easy
