Distributing probability over non-determinism
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 125769
- On possibility distribution
- A theory of possibility distributions
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
- scientific article; zbMATH DE number 1324656
- A theory of probability distributions
- Communicating Probability Distributions
- Estimation of possibility-probability distributions
Cited in
(66)- A monad for randomized algorithms
- Deterministic concurrent strategies
- A unification of probabilistic choice within a design-based model of reversible computation
- Algebraic presentation of semifree monads
- Weakest preconditions in fibrations
- Iterated covariant powerset is not a monad
- Lattices do not distribute over powerset
- Combining semilattices and semimodules
- Trust in event structures
- Causality in physics and computation
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Anatomy of a domain of continuous random variables. I
- Trace semantics via determinization
- Probabilistic NetKAT
- Categories of timed stochastic relations
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Identifying all preorders on the subdistribution monad
- Remarks on testing probabilistic processes
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Traces, Executions and Schedulers, Coalgebraically
- Data refinement with probability in mind
- Behavioural equivalences for timed systems
- Categories of empirical models
- Unifying theories of programming with monads
- Extending algebraic operations to D-completions
- Anatomy of a domain of continuous random variables. II
- A monad for probabilistic point processes
- No-go theorems for distributive laws
- Weakest preconditions in fibrations
- Convexity via Weak Distributive Laws
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
- The sub-additives: a proof theory for probabilistic choice extending linear logic
- Probabilistic Analysis of Binary Sessions
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
- The theory of traces for systems with nondeterminism, probability, and termination
- Implementing a library for probabilistic programming using non-strict non-determinism
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Combining probabilistic and non-deterministic choice via weak distributive laws
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- Distribution bisimilarity via the power of convex algebras
- Probabilistic completion of nondeterministic models
- Conditioning in probabilistic programming
- Convex lattice equation systems
- Smart Choices and the Selection Monad
- A coalgebraic approach to non-determinism: applications to multilattices
- Bunch theory: axioms, logic, applications and model
- Shades of iteration: from Elgot to Kleene
- Monads for measurable queries in probabilistic databases
- Semialgebras and weak distributive laws
- Correspondence between composite theories and distributive laws
- Weakening and iterating laws using string diagrams
- What monads can and cannot do with a bit of extra time
- What monads can and cannot do with a few extra pages
- A general completeness theorem for skip-free star algebras
- BiGKAT: an algebraic framework for relational verification of probabilistic programs
- A categorical treatment of open linear systems
- No go theorems: directed containers that do not distribute over distribution monads
- Convex language semantics for nondeterministic probabilistic automata
- Multisets and distributions
- Monotone weak distributive laws over the lifted powerset monad in categories of algebras
- Denotational semantics for probabilistic and concurrent programs
- A no-go theorem for coalgebraic product construction
- Generic weakest precondition semantics from monads enriched with order
- Behavioural equivalences for coalgebras with unobservable moves
- Factorisations of distributive laws
- Probabilistic anonymity via coalgebraic simulations
This page was built for publication: Distributing probability over non-determinism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466795)
