tracing relations probalistically

Abstract

We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We first show that the construction of traces for both kinds of relations follow the same principles of construction (which could be described in terms of monads, but this does not happen here). Finally representations of measurable trees in terms of probabilistic relations are given.