2026-07-22T06:49:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7721 2024-03-06T10:41:02Z ddc:004 open_access

Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or Castellan, Simon Clairambault, Pierre Winskel, Glynn Game semantics parallel-or concurrent games event structures full abstraction Although Plotkin’s parallel-or is inherently deterministic, it has a non-deterministic interpretation in games based on (prime) event structures - in which an event has a unique causal history - because they do not directly support disjunctive causality. General event structures can express disjunctive causality and have a more permissive notion of determinism, but do not support hiding. We show that (structures equivalent to) deterministic general event structures do support hiding, and construct a new category of games based on them with a deterministic interpretation of aPCFpor, an affine variant of PCF extended with parallel-or. We then exploit this deterministic interpretation to give a relaxed notion of determinism (observable determinism) on the plain event structures model. Putting this together with our previously introduced concurrent notions of well-bracketing and innocence, we obtain an intensionally fully abstract model of aPCFpor. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Simon Castellan and Pierre Clairambault and Glynn Winskel 2017 Is Part Of LIPIcs, Volume 84, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2017.12 urn:nbn:de:0030-drops-77219 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2017.12 eng https://creativecommons.org/licenses/by/3.0/legalcode