Testing Finitary Probabilistic Processes

Yuxin Deng; Rob van Glabbeek; Matthew Hennessy; Carroll Morgan

doi:10.1007/978-3-642-04081-8_19

Testing Finitary Probabilistic Processes

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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.

Original language	English
Title of host publication	CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings
Editors	Mario Bravetti, Gianluigi Zavattaro
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	274-288
Number of pages	15
ISBN (Electronic)	978-3-642-04081-8
ISBN (Print)	978-3-642-04080-1
DOIs	https://doi.org/10.1007/978-3-642-04081-8_19
Publication status	Published - 4 Sept 2009
Event	20th International Conference on Concurrency Theory 2009 - Bologna, Italy Duration: 1 Sept 2009 → 4 Sept 2009 Conference number: 20

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin, Heidelberg
Volume	5710
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on Concurrency Theory 2009
Abbreviated title	CONCUR 2009
Country/Territory	Italy
City	Bologna
Period	1/09/09 → 4/09/09

Access to Document

10.1007/978-3-642-04081-8_19Licence: All Rights Reserved

https://link.springer.com/chapter/10.1007/978-3-642-04081-8_19Licence: All Rights Reserved

Cite this

Deng, Y., van Glabbeek, R., Hennessy, M., & Morgan, C. (2009). Testing Finitary Probabilistic Processes. In M. Bravetti, & G. Zavattaro (Eds.), CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings (pp. 274-288). (Lecture Notes in Computer Science; Vol. 5710). Springer. https://doi.org/10.1007/978-3-642-04081-8_19

@inproceedings{5964065b97874833b20ed1f0fae309ca,

title = "Testing Finitary Probabilistic Processes",

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.",

author = "Yuxin Deng and {van Glabbeek}, Rob and Matthew Hennessy and Carroll Morgan",

year = "2009",

month = sep,

day = "4",

doi = "10.1007/978-3-642-04081-8_19",

language = "English",

isbn = "978-3-642-04080-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "274--288",

editor = "Mario Bravetti and Gianluigi Zavattaro",

booktitle = "CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings",

address = "United Kingdom",

note = "20th International Conference on Concurrency Theory 2009, CONCUR 2009 ; Conference date: 01-09-2009 Through 04-09-2009",

}

Deng, Y, van Glabbeek, R, Hennessy, M & Morgan, C 2009, Testing Finitary Probabilistic Processes. in M Bravetti & G Zavattaro (eds), CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings. Lecture Notes in Computer Science, vol. 5710, Springer, Berlin, Heidelberg, pp. 274-288, 20th International Conference on Concurrency Theory 2009, Bologna, Italy, 1/09/09. https://doi.org/10.1007/978-3-642-04081-8_19

Testing Finitary Probabilistic Processes. / Deng, Yuxin; van Glabbeek, Rob; Hennessy, Matthew et al.
CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings. ed. / Mario Bravetti; Gianluigi Zavattaro. Berlin, Heidelberg: Springer, 2009. p. 274-288 (Lecture Notes in Computer Science; Vol. 5710).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Testing Finitary Probabilistic Processes

AU - Deng, Yuxin

AU - van Glabbeek, Rob

AU - Hennessy, Matthew

AU - Morgan, Carroll

N1 - Conference code: 20

PY - 2009/9/4

Y1 - 2009/9/4

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.

U2 - 10.1007/978-3-642-04081-8_19

DO - 10.1007/978-3-642-04081-8_19

M3 - Conference contribution

SN - 978-3-642-04080-1

T3 - Lecture Notes in Computer Science

SP - 274

EP - 288

BT - CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings

A2 - Bravetti, Mario

A2 - Zavattaro, Gianluigi

PB - Springer

CY - Berlin, Heidelberg

T2 - 20th International Conference on Concurrency Theory 2009

Y2 - 1 September 2009 through 4 September 2009

ER -

Deng Y, van Glabbeek R, Hennessy M, Morgan C. Testing Finitary Probabilistic Processes. In Bravetti M, Zavattaro G, editors, CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings. Berlin, Heidelberg: Springer. 2009. p. 274-288. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-04081-8_19

Testing Finitary Probabilistic Processes

Abstract / Description of output

Publication series

Conference

Access to Document

Fingerprint

Cite this