Combining probabilistic and non-deterministic choice via weak distributive laws

DOI10.1145/3373718.3394795zbMath1502.68171OpenAlexW3024760727MaRDI QIDQ5145654

Daniela Petrişan, Alexandre Goy

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

probabilityprobabilistic automatanon-determinismbehavioral equivalenceweak distributive lawtrace semanticsweak liftingconvex powerset monadfinite distribution monad

Mathematics Subject Classification ID

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

Related Items (7)

Convexity via Weak Distributive Laws ⋮ Preservation and reflection of bisimilarity via invertible steps ⋮ Combining semilattices and semimodules ⋮ A trustful monad for axiomatic reasoning with probability and nondeterminism ⋮ Weakest preconditions in fibrations ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Algebraic presentation of semifree monads

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