posted on 2014-09-08, 10:53authored byRiccardo Bresciani, Andrew Butterfield
We have introduced probability in the UTP framework by
using functions from the state space to real numbers, which we term
distributions, that are embedded in the predicates describing the di er-
ent program constructs. This has allowed us to derive a probabilistic
theory of designs starting from a probabilistic version of the relational
theory, and continuing further down this road we can get to a theory
of probabilistic reactive programs. This paper presents the route that
connects these steps, and discusses the challenges lying ahead in view of
a probabilistic CSP based on distributions.
History
Publication
10th International Colloquium on Theoretical Aspects of Computing [Lecture Notes in Computer Science];8049, pp. 94-111
Publisher
Springer
Note
peer-reviewed
Other Funding information
SFI
Rights
The original publication is available at www.springerlink.com