The mays and musts of concurrent strategies

DOI10.1007/978-3-031-24117-8_9MaRDI QIDQ6612785

Simon Castellan, Pierre Clairambault, Glynn Winskel

Publication date: 1 October 2024

zbMATH Keywords

event structurestesting equivalence`may' and a must' equivalence on strategiesconcurrent games and strategiesstopping configurations

Mathematics Subject Classification ID

Quantum computation (81P68) Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed probabilistic and quantum strategies
• Strategies as concurrent processes
• Observation equivalence as a testing equivalence
• Models for concurrency: Towards a classification
• Prime algebraicity
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Testing equivalences for processes
• Non-angelic concurrent game semantics
• Deterministic concurrent strategies
• Event structures with symmetry
• The Winning Ways of Concurrent Games
• Thin Games with Symmetry and Concurrent Hyland-Ong Games
• Alternating-time temporal logic
• Asynchronous Games: Innocence Without Alternation
• Partial Orders, Event Structures and Linear Strategies
• A Theory of Communicating Sequential Processes
• Symmetry in concurrent games
• The Parallel Intensionally Fully Abstract Games Model of PCF
• Strategies as Profunctors
• Distributed Strategies Made Easy
• The concurrent game semantics of Probabilistic PCF
• Concurrent Quantum Strategies
• Foundations of Software Science and Computation Structures
• Games and Strategies as Event Structures

This page was built for publication: The mays and musts of concurrent strategies

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