Sequential Diagnosis Tool
Web Interface Help

 

 

System operation in the presence of faults can be presented by different system failure states. The goal of the diagnostic procedure is to identify the actual failure state by executing a sequence of tests which provide some information on system behaviour. In principle, any measurement, signal, or other observable event can be viewed as a test.

Determining the sequence of tests required to reach a diagnostic conclusion at minimum cost is known as the test sequencing problem.

More precisely, for a system described by the problem is to generate the diagnostic procedure such as that the average cost of the decision tree is minimized.

Test sequencing problem has been originally defined for symmetrical and binary tests. It was later generalized to include asymmetrical and multi-valued tests. (More details on this issue are given in the tutorial.)


SDT generates solutions for the generalized Test Sequencing Problem.

In order to run SDT the following input data are required:

Test matrix dimension is specified by
Algorithm: You can select one of the following algorithms for generation of the diagnostic procedure: (Default selection is AO* HEF1)

Test matrix - the following input data are required: Note: By default, tests are denoted by (t1, ..., tn), system states by (s0, ..., sm) and test costs are all equal to 1. Otherwise, notice that state names, test names and matrix elements should not contain spaces and colons. Any space or colon in system state or test name will be replaced with the '_' character, or removed in the outcome name. Names for tests, system states and outcomes should not exceed 12 character limit. Longer names will be shortened to the first 12 characters.


Display error messages


Submit values

Errors reported by web SDT

Web SDT checks and reports these errors:


links:
SDT Web Interface  |  SDT Examples |  SDT main page |  IJS Computer Systems Department