Computer Science – Software Engineering
Scientific paper
2011-06-21
EPTCS 55, 2011, pp. 84-100
Computer Science
Software Engineering
In Proceedings Refine 2011, arXiv:1106.3488
Scientific paper
10.4204/EPTCS.55.6
Before we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single universally agreed upon answer but by considering these questions at the outset we build a novel and hopefully intuitive probabilistic event-based formalism. In previous work we have characterised refinement via the notion of testing. Basically, if one system passes all the tests that another system passes (and maybe more) we say the first system is a refinement of the second. This is, in our view, an important way of characterising refinement, via the question "what sort of refinement should I be using?" We use testing in this paper as the basis for our refinement. We develop tests for probabilistic systems by analogy with the tests developed for non-probabilistic systems. We make sure that our probabilistic tests, when performed on non-probabilistic automata, give us refinement relations which agree with for those non-probabilistic automata. We formalise this property as a vertical refinement.
Reeves Steve
Streader David
No associations
LandOfFree
Refinement for Probabilistic Systems with Nondeterminism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Refinement for Probabilistic Systems with Nondeterminism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refinement for Probabilistic Systems with Nondeterminism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-177859