DeepAI AI Chat
Log In Sign Up

Termination in Convex Sets of Distributions

by   Ana Sokolova, et al.

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.


page 1

page 2

page 3

page 4


Combining Weak Distributive Laws: Application to Up-To Techniques

The coalgebraic modelling of alternating automata and of probabilistic a...

Concepts of Dimension for Convex Geometries

Let X be a finite set. A family P of subsets of X is called a convex geo...

Convexly independent subsets of Minkowski sums of convex polygons

We show that there exist convex n-gons P and Q such that the largest con...

On Concise Encodings of Preferred Extensions

Much work on argument systems has focussed on preferred extensions which...

Fast algorithms for handling diagonal constraints in timed automata

A popular method for solving reachability in timed automata proceeds by ...

Branch-Well-Structured Transition Systems and Extensions

We propose a relaxation to the definition of a well-structured transitio...