Strategies as concurrent processes

DOI10.1016/J.ENTCS.2014.10.006zbMath1337.68178OpenAlexW2000890988WikidataQ113317849 ScholiaQ113317849MaRDI QIDQ283745

Simon Castellan, Marc Lasson, Glynn Winskel, Jonathan Hayman

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.006

zbMATH Keywords

bicategoryevent structuresconcurrent game

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Rigid Families for the Reversible $$\pi $$ -Calculus ⋮ Event structure semantics of (controlled) reversible CCS ⋮ Event structures for the reversible early internal \(\pi\)-calculus ⋮ Distributed Strategies Made Easy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On concurrent games with payoff
• Distributed probabilistic and quantum strategies
• Testing equivalences for processes
• Full Abstraction for Fair Testing in CCS
• Event Structures with Symmetry
• Event Structure Spans for Nondeterministic Dataflow
• Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information
• The Winning Ways of Concurrent Games
• Some reasons for generalising domain theory
• Partial Orders, Event Structures and Linear Strategies
• Symmetry in concurrent games
• Strategies as Profunctors
• Profunctors, open maps and bisimulation

This page was built for publication: Strategies as concurrent processes