Distributed Strategies Made Easy
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5708038 (Why is no real title available?)
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 1361142 (Why is no real title available?)
- Asynchronous Games: Innocence Without Alternation
- Causality vs. interleavings in concurrent game semantics
- Distributed probabilistic and quantum strategies
- Event structures with symmetry
- Games and strategies as event structures
- Innocent strategies as presheaves and interactive equivalences for CCS
- Non-angelic concurrent game semantics
- Nondeterminism in game semantics via sheaves
- On concurrent games with payoff
- Partial Orders, Event Structures and Linear Strategies
- Probabilistic and quantum event structures
- Profunctors, open maps and bisimulation
- Some reasons for generalising domain theory
- Strategies as concurrent processes
- Strategies as profunctors
- The winning ways of concurrent games
- Winning, losing and drawing in concurrent games with perfect or imperfect information
Cited in
(9)- Distributed probabilistic and quantum strategies
- Strategies as concurrent processes
- The transient combinator, higher-order strategies, and the distributed data problem
- On probabilistic distributed strategies
- Probabilistic and quantum event structures
- The mays and musts of concurrent strategies
- A graph abstract machine describing event structure composition
- Strategies as profunctors
- Games and strategies as event structures
This page was built for publication: Distributed Strategies Made Easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111299)
