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
Lecture Notes in Computer Science
We propose a method for verification of probabilistic distributed systems in which a variation of Kozen's Kleene Algebra with Tests  is used to take account of the well-known interaction of probability and "adversarial" scheduling . We describe pKA, a probabilistic Kleene-style algebra, based on a widely accepted model of probabilistic/demonic computation [7, 25, 17] . Our technical aim is to express probabilistic versions of Cohen's separation theorems  . Separation theoremsdoi:10.1007/11828563_20 fatcat:nlh7zni2bzgtnaws4uuoze6nve