12.04.2013 Views

Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

Diagnosis and FTC by Prof. Blanke [pdf] - NTNU

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

79<br />

80<br />

Matching of a structure graph<br />

Matching of a structure graph means to relate<br />

unknown variables to known ones through<br />

constraints (solve for the unknown variables)<br />

A matching is complete if all unknown variables are<br />

matched<br />

Constraints that are not used <strong>by</strong> a complete matching<br />

(unmatched constraints) areusedto test the<br />

correctness of the solution<br />

These are parity relations of the problem <strong>and</strong> are<br />

used for diagnosis<br />

Mogens <strong>Blanke</strong> – Spring 2006<br />

Unmatched constraints are parity relations<br />

• Unmatched<br />

constraints<br />

constitute parity<br />

relations<br />

• Select one (shown<br />

<strong>by</strong> white color)<br />

• Trace the matching<br />

backwards (yellow)<br />

to get an analytic<br />

expression for the<br />

parity relation<br />

Mogens <strong>Blanke</strong> – Spring 2006<br />

40

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!