Publication Date:
2007
abstract:
The definition of behavioural preorders over process terms as the maximal (pre-)congruences induced by basic observables has proven to be a useful technique to define various preorders and equivalences in the non-probabilistic setting. In this paper, we consider probabilistic observables to define an observational semantics for a probabilistic pro- cess calculus. The resulting pre-congruence is proven to coincide with a probabilistic may preorder, which, in turn, corresponds to a natural probabilistic extension of the may testing preorder of De Nicola and Hennessy.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
D.2.4 Software and Program verification; 68Q85 Models and methods for concurrent and distributed computing; Probabilistic Automata; Process Algebra; Probabilistic Testing Theory
List of contributors:
Massink, Mieke
Book title:
4th International Conference on the Quantitative Evaluation of Systems, QEST