Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational methods in computer science
Relational methods in computer science
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Demonic Product of Probabilistic Relations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Semi-pullbacks and bisimulation in categories of Markov processes
Mathematical Structures in Computer Science
Tracing Relations Probabilistically
Fundamenta Informaticae
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
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 follows 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.