2 results
Ana Sokolova ; Harald Woracek.
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 […]
Published on November 20, 2018
Filippo Bonchi ; Ana Sokolova ; Valeria Vignudelli.
This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. We characterise and compare the […]
Published on June 17, 2022