Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/11260
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.date.accessioned | 2015-08-20T11:04:28Z | - |
dc.date.available | 2015-08-20T11:04:28Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | The Computer Journal, (2015) | en_US |
dc.identifier.issn | 1460-2067 | - |
dc.identifier.uri | http://comjnl.oxfordjournals.org/content/early/2015/08/05/comjnl.bxv057 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/11260 | - |
dc.description.abstract | There has been significant interest in distributed testing from an input output transition system. Previous work introduced an implementation relation $\dioco$ that was defined in terms of an equivalence relation on traces (sequences of observations). This paper considers an alternative approach in which an observation made in testing is a tuple of local traces, one for each tester. This paper defines such an implementation relation $\newdioco$ in terms of the possible observations regarding the system under test and the specification. It shows that $\newdioco$ is strictly weaker than $\dioco$ but is equivalent to $\dioco$ if processes cannot be output-divergent. Interestingly, this shows that the previous definition of $\dioco$ is too strong for output-divergent processes. We also prove that the Oracle problem is NP-complete but can be solved in polynomial time if there is an upper bound on the number of local testers. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Oxford University Press | en_US |
dc.subject | Distributed testing | en_US |
dc.subject | Model-based testing | en_US |
dc.subject | Software testing | en_US |
dc.title | A more precise implementation relation for distributed testing | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1093/comjnl/bxv057 | - |
dc.relation.isPartOf | The Computer Journal | - |
pubs.publication-status | Accepted | - |
pubs.publication-status | Accepted | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 380.81 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.