The concurrent game semantics of probabilistic PCF
From MaRDI portal
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of game theory (91A80)
Recommendations
Cited in
(22)- Full abstraction for PCF
- Taylor expansion, finiteness and strategies
- Continuous probability distributions in concurrent games
- Bayesian strategies: probabilistic programs as generalised graphical models
- A Mathematical Game Semantics of Concurrency and Nondeterminism
- On the equivalence of game and denotational semantics for the probabilistic -calculus
- The Parallel Intensionally Fully Abstract Games Model of PCF
- The geometry of Bayesian programming
- Fully abstract models of the probabilistic -calculus
- Differentials and distances in probabilistic coherence spaces
- scientific article; zbMATH DE number 7204431 (Why is no real title available?)
- Concurrent quantum strategies
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Probabilistic game semantics
- Causal Unfoldings
- Fooling the Parallel or Tester with Probability 8/27
- Zeta functions and the (linear) logic of Markov processes
- The mays and musts of concurrent strategies
- A tale of additives and concurrency in game semantics
- Disentangling parallelism and interference in game semantics
- From thin concurrent games to generalized species of structures (extended version)
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)