Deterministic concurrent strategies

DOI10.1007/s00165-012-0235-6zbMath1259.68148OpenAlexW2092712084MaRDI QIDQ1941878

Glynn Winskel

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0235-6

zbMATH Keywords

concurrent gamesevent structuresdeterministic strategies

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Distributed probabilistic and quantum strategies, From Qualitative to Quantitative Semantics, Partial-order Boolean games: informational independence in a logic-based model of strategic interaction, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Petri nets, event structures and domains. I
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Asynchronous games. II: The true concurrency of innocence
• The Winning Ways of Concurrent Games
• Asynchronous Games: Innocence Without Alternation
• Some reasons for generalising domain theory
• Characterising Testing Preorders for Finite Probabilistic Processes
• Profunctors, open maps and bisimulation
• Distributing probability over non-determinism