The concurrent game semantics of probabilistic PCF
From MaRDI portal
Publication:5145294
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) 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)
Recommendations
Cited in
(20)- Continuous probability distributions in concurrent games
- Bayesian strategies: probabilistic programs as generalised graphical models
- scientific article; zbMATH DE number 7577566 (Why is no real title available?)
- On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus
- scientific article; zbMATH DE number 7533341 (Why is no real title available?)
- Taylor expansion, finiteness and strategies
- Zeta functions and the (linear) logic of Markov processes
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Full abstraction for PCF
- The mays and musts of concurrent strategies
- A tale of additives and concurrency in game semantics
- Causal Unfoldings
- Disentangling parallelism and interference in game semantics
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Probabilistic game semantics
- Fooling the Parallel or Tester with Probability 8/27
- A Mathematical Game Semantics of Concurrency and Nondeterminism
- The Parallel Intensionally Fully Abstract Games Model of PCF
- Concurrent quantum strategies
- The geometry of Bayesian programming
This page was built for publication: The concurrent game semantics of probabilistic PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145294)