AbstractWe investigate the category of Eilenberg–Moore algebras for the Giry monad associated with stochastic relations over Polish spaces with continuous maps as morphisms. The algebras are identified as the positive convex structures on the base space. The forgetful functor assigning a positive convex structure the underlying Polish space has the stochastic powerdomain as its left adjoint
Convex algebras, also called (semi)convex sets, are at the heart of modellingprobabilistic systems i...
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an ass...
AbstractWe present a general method – the Machine – to analyse and characterise in finitary terms na...
AbstractWe investigate the category of Eilenberg–Moore algebras for the Giry monad associated with s...
We investigate the category of Eilenberg-Moore algebras for the Giry monad associated with stochasti...
AbstractIn Information and Computation 204 (2006), 1756–1781, the structure of Eilenberg-Moore algeb...
AbstractStochastic relations are the Kleisli morphisms for the Giry monad. This paper proposes the s...
AbstractThe probability measures on compact Hausdorff spaces K form a compact convex subset PK of th...
In this work we introduce some category-theoretical concepts and techniques to study probability dis...
We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence rel...
Probability theory can be studied synthetically as the computational effect embodied by a commutativ...
We show that the Giry monad is not strong with respect to the canonical symmetric monoidal closed st...
AbstractLabelled Markov processes (LMPs) are labelled transition systems in which each transition ha...
The monad of convex sets of probability distributions is a well-known tool for modelling the combina...
International audienceWe present a general method-the Machine-to analyse and characterise in finitar...
Convex algebras, also called (semi)convex sets, are at the heart of modellingprobabilistic systems i...
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an ass...
AbstractWe present a general method – the Machine – to analyse and characterise in finitary terms na...
AbstractWe investigate the category of Eilenberg–Moore algebras for the Giry monad associated with s...
We investigate the category of Eilenberg-Moore algebras for the Giry monad associated with stochasti...
AbstractIn Information and Computation 204 (2006), 1756–1781, the structure of Eilenberg-Moore algeb...
AbstractStochastic relations are the Kleisli morphisms for the Giry monad. This paper proposes the s...
AbstractThe probability measures on compact Hausdorff spaces K form a compact convex subset PK of th...
In this work we introduce some category-theoretical concepts and techniques to study probability dis...
We discuss congruences for stochastic relations, stressing the equivalence of smooth equivalence rel...
Probability theory can be studied synthetically as the computational effect embodied by a commutativ...
We show that the Giry monad is not strong with respect to the canonical symmetric monoidal closed st...
AbstractLabelled Markov processes (LMPs) are labelled transition systems in which each transition ha...
The monad of convex sets of probability distributions is a well-known tool for modelling the combina...
International audienceWe present a general method-the Machine-to analyse and characterise in finitar...
Convex algebras, also called (semi)convex sets, are at the heart of modellingprobabilistic systems i...
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an ass...
AbstractWe present a general method – the Machine – to analyse and characterise in finitary terms na...