Abstract
We provide both modal- and relational characterisations of may- and must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological properties, and express divergence in terms of partial distributions. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Deng, Y., Van Glabbeek, R., Hennessy, M., & Morgan, C. (2009). Testing Finitary Probabilistic Processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 274–288). https://doi.org/10.1007/978-3-642-04081-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
