Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/2968
Title: | Overcoming controllability problems with fewest channels between testers |
Authors: | Hierons, RM Ural, H |
Keywords: | Software testing;Ddistributed testers |
Issue Date: | 2009 |
Publisher: | Elsevier |
Citation: | Computer Networks 53(5): 680-690, Apr 2009 |
Abstract: | When testing a system that has multiple physically distributed ports/interfaces it is normal to place a tester at each port. Each tester observes only the events at its port and it is known that this can lead to additional controllability problems. While such controllability problems can be overcome by the exchange of external coordination messages between the testers, this requires the deployment of an external network and may thus increase the costs of testing. The problem studied in this paper is finding a minimum number of coordination channels to overcome controllability problems in distributed testing. Three instances of this problem are considered. The first problem is to find a minimum number of channels between testers in order to overcome the controllability problems in a given test sequence to be applied in testing. The second problem is finding a minimal set of channels that allow us to overcome controllability problems in any test sequence that may be selected from the specification of the system under test. The last problem is to find a test sequence that achieves a particular test objective and in doing so allows fewest channels to be used. |
URI: | http://bura.brunel.ac.uk/handle/2438/2968 |
ISSN: | 1389-1286 |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
channel_revised_minor.pdf | 188.38 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.