TY - GEN
T1 - Testing Finitary Probabilistic Processes
AU - Deng, Yuxin
AU - Van Glabbeek, Rob
AU - Hennessy, Matthew
AU - Morgan, Carroll
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/70349878673
U2 - 10.1007/978-3-642-04081-8_19
DO - 10.1007/978-3-642-04081-8_19
M3 - 会议稿件
AN - SCOPUS:70349878673
SN - 3642040802
SN - 9783642040801
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 274
EP - 288
BT - CONCUR 2009 - Concurrency Theory - 20th International Conference, CONCUR 2009, Proceedings
T2 - 20th International Conference on Concurrency Theory, CONCUR 2009
Y2 - 1 September 2009 through 4 September 2009
ER -