Tracing Relations Probabilistically
We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We show that the construction of traces for both kinds of relations follow the same principles of construction. Representations of measurable trees in terms of probabilistic relations are given. This shows that stochastic relations may serve as refinements of their non-deterministic counterparts. A convexity argument formalizes the observation that non-deterministic system descriptions are underspecified when compared to probabilistic ones. The mathematical tools come essentially from the theory of measurable selections.
KeywordsProbabilistic relations specification techniques non-deterministic stochastic representation theory
Unable to display preview. Download preview PDF.
- 4.Doberkat, E.-E.: Stochastic relations interpreting modal logic. Technical Report 144, Chair for Software-Technology, University of Dortmund (October 2003)Google Scholar
- 5.Panangaden, P.: Probabilistic relations. In: Baier, C., Huth, M., Kwiatkowska, M., Ryan, M. (eds.) Proc. PROBMIV, pp. 59–74 (1998), Also available from the School of Computer Science, McGill University, MontrealsGoogle Scholar