Publication:
Remarks on Testing Probabilistic Processes
Remarks on Testing Probabilistic Processes
dc.contributor.author | Morgan, Charles | en_US |
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 | Hennessy, M | en_US |
dc.date.accessioned | 2021-11-25T15:25:54Z | |
dc.date.available | 2021-11-25T15:25:54Z | |
dc.date.issued | 2007 | en_US |
dc.description.abstract | We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer valid in our probabilistic setting; even for non-probabilistic CSP processes, the distinguishing power of probabilistic tests is much greater than that of standard tests. We develop a method for deriving inequations valid in probabilistic may testing based on a probabilistic extension of the notion of simulation. Using this, we obtain a complete axiomatisation for non-probabilistic processes subject to probabilistic may testing. © 2007 Elsevier B.V. All rights reserved. | en_US |
dc.identifier.issn | 1571-0661 | en_US |
dc.identifier.uri | http://hdl.handle.net/1959.4/44459 | |
dc.language | English | |
dc.language.iso | EN | 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.subject.other | Probabilistic logics | en_US |
dc.subject.other | Algebra | en_US |
dc.subject.other | Computer science | en_US |
dc.subject.other | Computer simulation | en_US |
dc.subject.other | Differentiation (calculus | en_US |
dc.title | Remarks on Testing Probabilistic Processes | en_US |
dc.type | Journal Article | 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 | Electronic Notes in Theoretical Computer Science is available via: http://www.sciencedirect.com/science/journal/15710661 | en_US |
unsw.identifier.doiPublisher | http://dx.doi.org/10.1016/j.entcs.2007.02.013 | en_US |
unsw.relation.faculty | Engineering | |
unsw.relation.ispartofissue | 1 | en_US |
unsw.relation.ispartofjournal | Electronic Notes in Theoretical Computer Science | en_US |
unsw.relation.ispartofpagefrompageto | 359-397 | en_US |
unsw.relation.ispartofvolume | 172 | en_US |
unsw.relation.originalPublicationAffiliation | Morgan, Charles, Computer Science & Engineering, Faculty of Engineering, UNSW | 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 | Hennessy, M | en_US |
unsw.relation.school | School of Computer Science and Engineering | * |
Files
Original bundle
1 - 1 of 1