Termination in convex sets of distributions

From MaRDI portal
Publication:4558786

DOI10.23638/LMCS-14(4:17)2018zbMATH Open1400.68146arXiv1710.10402OpenAlexW2767081344MaRDI QIDQ4558786FDOQ4558786


Authors: Ana Sokolova, Harald Woracek Edit this on Wikidata


Publication date: 30 November 2018

Abstract: 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 convex geometry. In this paper we study the problem of extending a convex algebra by a single point. Such extensions enable the modelling of termination in probabilistic systems. We provide a full description of all possible extensions for a particular class of convex algebras: For a fixed convex subset D of a vector space satisfying additional technical condition, we consider the algebra of convex subsets of D. This class contains the convex algebras of convex subsets of distributions, modelling (nondeterministic) probabilistic automata. We also provide a full description of all possible extensions for the class of free convex algebras, modelling fully probabilistic systems. Finally, we show that there is a unique functorial extension, the so-called black-hole extension.


Full work available at URL: https://arxiv.org/abs/1710.10402




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Termination in convex sets of distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558786)