Scalar outcomes suffice for finitary probabilistic testing

Download files
Access & Terms of Use
open access
Abstract
The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred with the insight that tests expressed within the concurrent framework itself, based on a special “success action”, yield equivalences that make only inarguable distinctions. When probability was added, however, it seemed necessary to extend the testing framework beyond a direct probabilistic generalisation in order to remain useful. An attractive possibility was the extension to multiple success actions that yielded vectors of real-valued outcomes. Here we prove that such vectors are unnecessary when processes are finitary, that is finitely branching and finite-state: single scalar outcomes are just as powerful. Thus for finitary processes we can retain the original, simpler testing approach and its direct connections to other naturally scalar-valued phenomena.
Persistent link to this record
DOI
Additional Link
Author(s)
Zhang, Chenyi
Deng, Yuxin
van Glabbeek, Robert
Morgan, Charles
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2007
Resource Type
Conference Paper
Degree Type
UNSW Faculty
Files
download 0200701708_scalar.pdf 716.23 KB Adobe Portable Document Format
Related dataset(s)