Testing Finitary Probabilistic Processes (Extended Abstract)

Select |




Print


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll

Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll


2009-08-01


Conference Material


20th International Conference on Concurrency Theory (CONCUR 2009)


Bologna, Italy


274-288


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.


Springer


Probabilistic processes, nondeterminism, CSP, transition systems, testing equivalences, simulation, failure simulation, modal characterisations, divergence.


http://concur09.cs.unibo.it/


0302-9743


nicta:1783


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll. Testing Finitary Probabilistic Processes (Extended Abstract). In: Mario Bravetti and Gianluigi Zavattaro Editor, editor/s. 20th International Conference on Concurrency Theory (CONCUR 2009); Bologna, Italy. Springer; 2009-08-01. 274-288.



Loading citation data...

Citation counts
(Requires subscription to view)