tidied algorithms

This commit is contained in:
Robin Clark 2010-06-21 14:27:25 +01:00
parent 414903214c
commit da51a2981e

View File

@ -519,7 +519,7 @@ verification checks in the process can be stated formally.
\ENSURE{ Each component $C \in FG $ has a known set of failure modes i.e. $FM(C) \neq \emptyset$ }
\STATE {let $FM(FG)$ be a set of all failure modes to consider for the functional~group $FG$}
\STATE {let $F=FM(FG)$ be a set of all failure modes to consider for the functional~group $FG$}
%\STATE {Collect all failure modes from all the components in FG into the set $FG_{cfm}$}
%\FORALL { $c \in FG $ }
@ -544,7 +544,7 @@ in the analysis stages.
\begin{algorithm}[h+]
~\label{alg:sympabs2}
\caption{Determine Test Cases: $FM(FG) \mapsto TC $} \label{alg:sympabs22}
\caption{Determine Test Cases: $F \mapsto TC $} \label{alg:sympabs22}
\begin{algorithmic}[1]
\REQUIRE {Determine the test cases to be applied}
@ -571,8 +571,8 @@ in the analysis stages.
\FORALL { $tc_j \in TC$ }
%\ENSURE {$ tc_j \in \bigcap FG_{cfm} $}
\ENSURE {$ tc_j \in \mathcal{P}(FM(FG))$}
\COMMENT { require that the test case is a member of the powerset of $FM(FG)$ }
\ENSURE {$ tc_j \in \mathcal{P}(F))$}
\COMMENT { require that the test case is a member of the powerset of $F$ }
\ENSURE { $ \forall \; j2 \; \in J ( \forall \; j1 \; \in J | tc_{j1} \neq tc_{j2} \; \wedge \; j1 \neq j2 ) $}
\COMMENT { Test cases must be unique }
\ENDFOR
@ -581,12 +581,12 @@ in the analysis stages.
\STATE { let $f$ represet a component failure mode }
\REQUIRE { That all failure modes are represented in at least one test case }
\ENSURE { $ \forall f | (f \in FM(FG)) \wedge (f \in \bigcup TC) $ }
\ENSURE { $ \forall f | (f \in F)) \wedge (f \in \bigcup TC) $ }
\COMMENT { This corresponds to checking that at least each failure mode is considered at least once in the analysis; some european standards
imply checking all double fault combinations\cite{en298} }
%\hline
Algorithm \ref{alg:sympabs22} has taken the set of failure modes $ FM(FG) $ and returned a set of test cases $TC$.
Algorithm \ref{alg:sympabs22} has taken the set of failure modes $ F=FM(FG) $ and returned a set of test cases $TC$.
The next stages is to analyse the effect of each test case on the functional group.
\end{algorithmic}