Document - Basic observables for probabilistic may testing

2007

Conference article Restricted

Basic observables for probabilistic may testing

Palmeri M. C., De Nicola R., Massink M.

68Q85 Models and methods for concurrent and distributed computing Probabilistic Testing Theory Process Algebra D.2.4 Software and Program verification Probabilistic Automata

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.

Source: Fourth International Conference on the Quantitative Evaluation of Systems, pp. 189–198, Edinburgh, Scotland, U.K., 17-19 September 2007

Publisher: IEEE Computer Society, Los Alamitos [CA], USA

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:91746,
	title = {Basic observables for probabilistic may testing},
	author = {Palmeri M.  C. and De Nicola R. and Massink M.},
	publisher = {IEEE Computer Society, Los Alamitos [CA], USA},
	doi = {10.1109/qest.2007.19},
	booktitle = {Fourth International Conference on the Quantitative Evaluation of Systems, pp. 189–198, Edinburgh, Scotland, U.K., 17-19 September 2007},
	year = {2007}
}