Publication:
Scalar outcomes suffice for finitary probabilistic testing
Scalar outcomes suffice for finitary probabilistic testing
dc.contributor.author | Zhang, Chenyi | en_US |
dc.contributor.author | Deng, Yuxin | en_US |
dc.contributor.author | van Glabbeek, Robert | en_US |
dc.contributor.author | Morgan, Charles | en_US |
dc.date.accessioned | 2021-11-25T15:26:05Z | |
dc.date.available | 2021-11-25T15:26:05Z | |
dc.date.issued | 2007 | en_US |
dc.description.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. | en_US |
dc.identifier.isbn | 9783540713142 | en_US |
dc.identifier.uri | http://hdl.handle.net/1959.4/44460 | |
dc.language | English | |
dc.language.iso | EN | en_US |
dc.publisher | Springer | en_US |
dc.rights | CC BY-NC-ND 3.0 | en_US |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/3.0/au/ | en_US |
dc.source | Legacy MARC | en_US |
dc.title | Scalar outcomes suffice for finitary probabilistic testing | en_US |
dc.type | Conference Paper | en |
dcterms.accessRights | open access | |
dspace.entity.type | Publication | en_US |
unsw.accessRights.uri | https://purl.org/coar/access_right/c_abf2 | |
unsw.description.publisherStatement | The original publication is available at www.springerlink.com | en_US |
unsw.identifier.doiPublisher | http://dx.doi.org/10.1007/978-3-540-71316-6_25 | en_US |
unsw.publisher.place | New York | en_US |
unsw.relation.faculty | Engineering | |
unsw.relation.ispartofconferenceLocation | Braga, Portugal | en_US |
unsw.relation.ispartofconferenceName | 16th European symposium on programming, 2007 | en_US |
unsw.relation.ispartofconferenceProceedingsTitle | Programming languages and systems | en_US |
unsw.relation.ispartofconferenceYear | 2007 | en_US |
unsw.relation.ispartofpagefrompageto | 363-378 | en_US |
unsw.relation.originalPublicationAffiliation | Zhang, Chenyi, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
unsw.relation.originalPublicationAffiliation | Deng, Yuxin, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
unsw.relation.originalPublicationAffiliation | van Glabbeek, Robert, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
unsw.relation.originalPublicationAffiliation | Morgan, Charles, Computer Science & Engineering, Faculty of Engineering, UNSW | en_US |
unsw.relation.school | School of Computer Science and Engineering | * |
Files
Original bundle
1 - 1 of 1