Combining probabilistic and non-deterministic choice via weak distributive laws

DOI10.1145/3373718.3394795MaRDI QIDQ5145654zbMATH OpenOpenAlexFDO

Authors Alexandre Goy, Daniela Petrişan

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373718.3394795

zbMATH Keywords

behavioral equivalenceconvex powerset monadfinite distribution monadnon-determinismprobabilistic automataprobabilitytrace semanticsweak distributive lawweak lifting

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Probability theory on algebraic and topological structures (60B99) Semantics in the theory of computing (68Q55)

Recommendations

• Distributing probability over non-determinism
• Layer by layer -- combining monads
• Semantic domains for combining probability and non-determinism
• scientific article; zbMATH DE number 1759622
• A trustful monad for axiomatic reasoning with probability and nondeterminism

Cited in

(21)

• Algebraic presentation of semifree monads
• Combining semilattices and semimodules
• Weakest preconditions in fibrations
• Convexity via Weak Distributive Laws
• Monads and Quantitative Equational Theories for Nondeterminism and Probability
• A trustful monad for axiomatic reasoning with probability and nondeterminism
• Preservation and reflection of bisimilarity via invertible steps
• Sum and tensor of quantitative effects
• Infinite choice and probability distributions. An open problem: the real hotel
• 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
• 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
• Powerset-like monads weakly distribute over themselves in toposes and compact Hausdorff spaces
• Monotone weak distributive laws over the lifted powerset monad in categories of algebras
• Traces via strategies in two-player games
• Probabilistic predicate transformers. II: Partially observable probability

This page was built for publication: Combining probabilistic and non-deterministic choice via weak distributive laws

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145654)