تقرير
Testing Probabilistic Processes: Can Random Choices Be Unobservable?
| العنوان: | Testing Probabilistic Processes: Can Random Choices Be Unobservable? |
|---|---|
| المؤلفون: | Georgievska, Sonja, Andova, Suzana |
| سنة النشر: | 2009 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Logic in Computer Science |
| الوصف: | 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. Comment: 24 pages |
| نوع الوثيقة: | Working Paper |
| الوصول الحر: | http://arxiv.org/abs/0907.1540Test |
| رقم الانضمام: | edsarx.0907.1540 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |