Deterministic concurrent strategies
type: Item
instance of: scholarly article
title: Deterministic concurrent strategies
zbMATH Open document ID: 1259.68148
author: Glynn Winskel
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6148343
zbMATH Keywords: concurrent games
zbMATH Keywords: deterministic strategies
zbMATH Keywords: event structures
MaRDI profile type: Publication
full work available at URL: s00165-012-0235-6
OpenAlex ID: W2092712084
cites work: Full abstraction for PCF
cites work: Profunctors, open maps and bisimulation
cites work: The Winning Ways of Concurrent Games
cites work: Characterising Testing Preorders for Finite Probabilistic Processes
cites work: Some reasons for generalising domain theory
cites work: On full abstraction for PCF: I, II and III
cites work: Q4225150
cites work: Asynchronous games. II: The true concurrency of innocence
cites work: Asynchronous Games: Innocence Without Alternation
cites work: Petri nets, event structures and domains. I
cites work: Distributing probability over non-determinism
cites work: Q3667958
DOI: 10.1007/S00165-012-0235-6
description: scientific article; zbMATH DE number 6148343