TREEDIAG Algorithm

TREEDIAG is a special model-based diagnosis algorithm for tree-structured diagnosis systems. Diagnoses are computed by descending into the tree, enumerating the input combinations that might be responsible for a given inocrrect observation, and combining the diagnoses for the subtrees generating these inputs into diagnoses of the whole system. TREEDIAG has been proven to be faster than other algorithms for tree-structured systems. This homepage gives access to technical reports and literature related to tree and a Smalltalk implementation using Parc Place Visualworks 2.52.

For further informations contact Markus Stumptner or Franz Wotawa.
Last modified 27.11.1997