Goy, Alexandre; Petrişan, Daniela Combining probabilistic and non-deterministic choice via weak distributive laws. (English) Zbl 1502.68171 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 454-464 (2020). Cited in 7 Documents MSC: 68Q55 Semantics in the theory of computing 18C50 Categorical semantics of formal languages 60B99 Probability theory on algebraic and topological structures Keywords:behavioral equivalence; convex powerset monad; finite distribution monad; non-determinism; probabilistic automata; probability; trace semantics; weak distributive law; weak lifting PDFBibTeX XMLCite \textit{A. Goy} and \textit{D. Petrişan}, in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 454--464 (2020; Zbl 1502.68171) Full Text: DOI HAL