Zur Seitenansicht
 

Titelaufnahme

Titel
Termination in Convex Sets of Distributions
VerfasserSokolova, Ana ; Woracek, Harald
Erschienen in
Logical Methods in Computer Science, Braunschweig, 2018, Jg. 14, H. 4, S. 1-28
ErschienenBraunschweig : Logical Methods in Computer Science, 2018
SpracheEnglisch
DokumenttypAufsatz in einer Zeitschrift
Schlagwörter (EN)convex algebra / one-point extensions / convex powerset monad
ISSN1860-5974
URNurn:nbn:at:at-ubs:3-11216 Persistent Identifier (URN)
DOI10.23638/LMCS-14(4:17)2018 
Zugriffsbeschränkung
 Das Werk ist frei verfügbar
Dateien
Termination in Convex Sets of Distributions [0.43 mb]
Links
Nachweis
Klassifikation
Zusammenfassung (Englisch)

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.

Statistik
Das PDF-Dokument wurde 2 mal heruntergeladen.
Lizenz
CC-BY-Lizenz (4.0)Creative Commons Namensnennung 4.0 International Lizenz