Combining probabilistic and non-deterministic choice via weak distributive laws

DOI10.1145/3373718.3394795MaRDI QIDQ5145654zbMATHOpenAlexFDO

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

probabilistic automataprobabilitynon-determinismbehavioral equivalenceweak distributive lawtrace semanticsweak liftingconvex powerset monadfinite distribution monad

Mathematics Subject Classification ID

Probability theory on algebraic and topological structures (60B99) Categorical semantics of formal languages (18C50) 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

(12)

• Convexity via Weak Distributive Laws
• Monads for measurable queries in probabilistic databases
• Semialgebras and weak distributive laws
• Preservation and reflection of bisimilarity via invertible steps
• Monads and Quantitative Equational Theories for Nondeterminism and Probability
• A trustful monad for axiomatic reasoning with probability and nondeterminism
• Infinite choice and probability distributions. An open problem: the real hotel
• Weakest preconditions in fibrations
• Algebraic presentation of semifree monads
• Sum and tensor of quantitative effects
• Combining semilattices and semimodules
• Correspondence between composite theories and distributive laws

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)