Heuristics for fault diagnosis when testing from finite state machines

Q Guo, R A Hierons, M Harman, K Derderian

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

When testing from finite state machines, a failure observed in the implementation under test (IUT) is called a symptom. A symptom could have been caused by an earlier state transfer failure. Transitions that may be used to explain the observed symptoms are called diagnosing candidates. Finding strategies to generate an optimal set of diagnosing candidates that could effectively identify faults in the IUT is of great value in reducing the cost of system development and testing. This paper investigates fault diagnosis when testing from finite state machines and proposes heuristics for fault isolation and identification. The proposed heuristics attempt to lead to a symptom being observed in some shorter test sequences, which helps to reduce the cost of fault isolation and identification. The complexity of the proposed method is analysed. A case study is presented, which shows how the proposed approach assists in fault diagnosis. Copyright 2006 John Wiley & Sons, Ltd
Original languageEnglish
Pages (from-to)41 - 57
Number of pages17
JournalSOFTWARE TESTING VERIFICATION AND RELIABILITY
Volume17
Issue number1
DOIs
Publication statusPublished - Mar 2007

Fingerprint

Dive into the research topics of 'Heuristics for fault diagnosis when testing from finite state machines'. Together they form a unique fingerprint.

Cite this