scientific article; zbMATH DE number 7204431

DOI10.4230/LIPICS.FSCD.2017.12zbMATH Open1441.68144MaRDI QIDQ5111308FDOQ5111308

Authors: Simon Castellan, Pierre Clairambault, Glynn Winskel 

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• The Parallel Intensionally Fully Abstract Games Model of PCF
• Deterministic concurrent strategies
• The concurrent game semantics of probabilistic PCF
• The winning ways of concurrent games
• Concurrent structures in game semantics

zbMATH Keywords

concurrent gamesfull abstractiongame semanticsevent structuresparallel-or

Mathematics Subject Classification ID

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

Cites Work

• LCF considered as a programming language
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Deterministic concurrent strategies
• Asynchronous Games: Innocence Without Alternation
• Title not available (Why is that?)
• Strategies as profunctors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fully abstract semantics for observably sequential languages
• Causality vs. interleavings in concurrent game semantics
• Title not available (Why is that?)
• The Parallel Intensionally Fully Abstract Games Model of PCF
• Title not available (Why is that?)
• Games and strategies as event structures
• Angelic semantics of fine-grained concurrency
• Full abstraction for fair testing in CCS (expanded version)

Cited In (3)

• Continuous probability distributions in concurrent games
• A tale of additives and concurrency in game semantics
• Causal Unfoldings and Disjunctive Causes

This page was built for publication:

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