Determinizing Probabilistic Automata via Weak Distributive Laws

In this talk we present a category-theoretic approach to obtaining a belief-state transformer, that is, a transition system where the state space carries a convex algebra structure, from a probabilistic automaton. We do so by proving the existence of a weak distributive law of the powerset monad over the distribution monad. This is joint work with Alexandre Goy.

Authors

• Daniela Petrisan

Keywords

No keywords are indexed for this paper.