Computer Science – Logic in Computer Science
Scientific paper
2009-07-09
Computer Science
Logic in Computer Science
24 pages
Scientific paper
A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the internal choice is quantified with probabilities. However, ever since probabilities have been introduced in process semantics, it has been a challenge to preserve the unobservability of the random choice, while not violating the other laws of process theory and probability theory. This paper addresses this problem. It proposes two semantics for processes where the internal nondeterminism has been quantified with probabilities. The first one is based on the notion of testing, i.e. interaction between the process and its environment. The second one, the probabilistic ready trace semantics, is based on the notion of observability. Both are shown to coincide. They are also preserved under the standard operators.
Andova Suzana
Georgievska Sonja
No associations
LandOfFree
Testing Probabilistic Processes: Can Random Choices Be Unobservable? 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 Testing Probabilistic Processes: Can Random Choices Be Unobservable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing Probabilistic Processes: Can Random Choices Be Unobservable? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-341710