A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Towards Automated Proof Support for Probabilistic Distributed Systems
[chapter]
2005
Lecture Notes in Computer Science
The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience indicates [12, 4, 11] that there are many difficulties in automating real-number arithmetic in the context of other program features. In this paper we propose a framework for verification of probabilistic distributed systems based on the generalisation of Kleene algebra with tests that has been used as a basis for development of
doi:10.1007/11591191_37
fatcat:ehhm7ahxnzh6rl2pt56jdnfpaa