Deterministic concurrent strategies

DOI10.1007/S00165-012-0235-6MaRDI QIDQ1941878zbMATH OpenOpenAlexFDO

Authors 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 gamesdeterministic strategiesevent structures

Mathematics Subject Classification ID

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) Applications of game theory (91A80)

Recommendations

• Bicategories of concurrent games (invited paper)
• The winning ways of concurrent games
• Winning, losing and drawing in concurrent games with perfect or imperfect information
• Games and strategies as event structures
• Strategies as profunctors

Cites work

• Asynchronous games. II: The true concurrency of innocence
• Asynchronous Games: Innocence Without Alternation
• Characterising Testing Preorders for Finite Probabilistic Processes
• Distributing probability over non-determinism
• Full abstraction for PCF
• scientific article; zbMATH DE number 3821120 (Why is no real title available?)
• scientific article; zbMATH DE number 1241700 (Why is no real title available?)
• On full abstraction for PCF: I, II and III
• Petri nets, event structures and domains. I
• Profunctors, open maps and bisimulation
• Some reasons for generalising domain theory
• The winning ways of concurrent games

Cited in

(18)

• Categorical combinatorics for non deterministic strategies on simple games
• Distributed probabilistic and quantum strategies
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• Strategies as concurrent processes
• Bicategories of concurrent games (invited paper)
• Winning, losing and drawing in concurrent games with perfect or imperfect information
• The winning ways of concurrent games
• From qualitative to quantitative semantics. By change of base
• Deterministic Negotiations: Concurrency for Free
• scientific article; zbMATH DE number 23767 (Why is no real title available?)
• Strategies as profunctors
• Distributed Strategies Made Easy
• scientific article; zbMATH DE number 7204431 (Why is no real title available?)
• Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
• Games and strategies as event structures
• The mays and musts of concurrent strategies
• Disentangling parallelism and interference in game semantics
• Concurrent games over relational structures: the origin of game comonads

This page was built for publication: Deterministic concurrent strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941878)