Combining probabilistic and non-deterministic choice via weak distributive laws
DOI10.1145/3373718.3394795zbMATH Open1502.68171OpenAlexW3024760727MaRDI QIDQ5145654FDOQ5145654
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
probabilistic automataprobabilitynon-determinismbehavioral equivalenceweak distributive lawtrace semanticsweak liftingconvex powerset monadfinite distribution monad
Probability theory on algebraic and topological structures (60B99) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55)
Cited In (11)
- Algebraic presentation of semifree monads
- Combining semilattices and semimodules
- Weakest preconditions in fibrations
- A trustful monad for axiomatic reasoning with probability and nondeterminism
- Sum and tensor of quantitative effects
- Preservation and reflection of bisimilarity via invertible steps
- Monads for measurable queries in probabilistic databases
- Semialgebras and weak distributive laws
- Convexity via Weak Distributive Laws
- Correspondence between composite theories and distributive laws
- Monads and Quantitative Equational Theories for Nondeterminism and 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)
