Search

• < Previous
• 1
• Next >

Termination in Convex Sets of Distributions

Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad. Concretely, they have been studied for decades within algebra and&nbsp;[&hellip;]