Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/344
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.coverage.spatial | 14 | en |
dc.date.accessioned | 2006-11-06T09:41:15Z | - |
dc.date.available | 2006-11-06T09:41:15Z | - |
dc.date.issued | 1999 | - |
dc.identifier.citation | Computer Communications, 22(2): 120-127(8), Jan 1999 | en |
dc.identifier.uri | http://www.ingentaconnect.com/content/els/01403664/1999/00000022/00000002/art00251;jsessionid=b3k6k7sam75ai.alice | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/344 | - |
dc.description.abstract | If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and coworkers generate a set of candidates and then produce further tests to locate the failures within this set. We consider a special case where there is a state identification process that is known to be correct. A number of preset and adaptive approaches to fault location are described and the problem of minimizing the cost is explored. Some of the approaches lead to NP-hard optimization problems for which possible heuristics are suggested. | en |
dc.format.extent | 373645 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier Science | en |
dc.subject | Finite state machine | en |
dc.subject | Fault location | en |
dc.subject | Adaptive testing | en |
dc.subject | Minimal length test | en |
dc.title | Minimizing the cost of fault location when testing from a finite state machine | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1016/S0140-3664(98)00251-5 | - |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Minimizing the cost.pdf | 1.45 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.