Trustworthy Systems

Testing finitary probabilistic processes (extended abstract)

Authors

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy and Carroll Morgan

Shanghai Jiao Tong University

NICTA

UNSW

Trinity College Dublin

Abstract

This paper provides 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 capture divergence in terms of partial distributions.

BibTeX Entry

  @inproceedings{Deng_GHM_09,
    address          = {Bologna, Italy},
    author           = {Deng, Yuxin and van Glabbeek, Robert and Hennessy, Matthew and Morgan, Carroll},
    booktitle        = {International Conference on Concurrency Theory (CONCUR)},
    editor           = {{Mario Bravetti and Gianluigi Zavattaro}},
    issn             = {0302-9743},
    keywords         = {probabilistic processes, nondeterminism, csp, transition systems, testing equivalences, simulation,
                        failure simulation, modal characterisations, divergence.},
    month            = aug,
    pages            = {274--288},
    paperurl         = {https://trustworthy.systems/publications/nicta_full_text/1783.pdf},
    publisher        = {Springer},
    title            = {Testing Finitary Probabilistic Processes (Extended Abstract)},
    year             = {2009}
  }

Download