Algorithm list tidy + cup to form union

This commit is contained in:
Robin Clark 2010-08-16 11:05:27 +01:00
parent 0afe1dacb0
commit 60703dcbe1
2 changed files with 12 additions and 11 deletions

View File

@ -56,7 +56,7 @@ The algorithm, represented by the symbol `$\bowtie$', has been broken down into
By defining the process and describing it using set theory, constraints and
verification checks in the process are stated formally.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%\clearpage
\clearpage
\subsection{ Determine Failure \\ Modes to examine}
The first stage is to find the failure modes to consider for
@ -80,7 +80,7 @@ $$FM(FG) = F$$
\begin{algorithm}[h+]
~\label{alg1}
\caption{FM( $FG$ )} \label{alg11}
\caption{Determine Failure Modes: FM( $FG$ )} \label{alg11}
\begin{algorithmic}[1]
\REQUIRE {FG is a set of components (a functional~group)}
@ -131,7 +131,7 @@ $$ DTC(F) = TC $$
\begin{algorithm}[h+]
~\label{alg2}
\caption{DTC: (F) } \label{alg22}
\caption{Determine Test Cases: DTC: (F) } \label{alg22}
\begin{algorithmic}[1]
\REQUIRE {F is a flat set of failure modes }
@ -202,13 +202,13 @@ The next stage is to analyse the effect of each test case on the functional grou
The test cases are now analysed for their impact on the behaviour of the functional~group.
Let $R$ be a set of test case analysis results, indexed by $j$ (the same index used to identify the test cases $tc_{j}$).
$$ATC: \mathcal{TC} \rightarrow \mathcal{R} $$A
$$ ATC: \mathcal{TC} \rightarrow \mathcal{R} $$A
given by
$$ ATC(TC) = R $$
\begin{algorithm}[h+]
~\label{alg3}
\caption{ATC(TC) } \label{alg33}
\caption{Analyse Test Cases: ATC(TC) } \label{alg33}
\begin{algorithmic}[1]
\STATE { let r be a `test case result'}
\STATE { Let the function $Analyse : tc \mapsto r $ } \COMMENT { This analysis is a human activity, examining the failure~modes in the test case and determining how the functional~group will fail under those conditions}
@ -216,7 +216,7 @@ $$ ATC(TC) = R $$
\FORALL { $tc_j \in TC$ }
\STATE { $ rc_j = Analyse(tc_j) $} \COMMENT {this is Fault Mode Effects Analysis (FMEA) applied in the context of the functional group}
%\STATE { $ rc_j \in R $ } \COMMENT{Add $rc_j$ to the set R}
\STATE{ $ R := R \cap rc_j $ } \COMMENT{Add $rc_j$ to the set R}
\STATE{ $ R := R \cup rc_j $ } \COMMENT{Add $rc_j$ to the set R}
\ENDFOR
\RETURN $R$
@ -275,7 +275,7 @@ $$ FCS(R) = SP $$
\begin{algorithm}[h+]
~\label{alg4}
\caption{FCS($R$)} \label{alg44}
\caption{Find Common Symptoms: FCS($R$)} \label{alg44}
\begin{algorithmic}[1]
@ -366,7 +366,7 @@ $$ CDC(SP) = DC $$
\begin{algorithm}[h+]
~\label{alg5}
\caption{CDC(SP) } \label{alg55}
\caption{Create Derived Component: CDC(SP) } \label{alg55}
\begin{algorithmic}[1]
@ -374,7 +374,7 @@ $$ CDC(SP) = DC $$
\FORALL { $sp_l \in SP$ }
\STATE { $ f_l = ConvertToFaultMode(sp_l) $}
%\STATE { $ f_l \in DC $} \COMMENT{ this is saying place $f_l$ into $DC$'s collection of failure modes}
\STATE { $DC := DC \cap f_l$ } \COMMENT{ this is saying place $f_l$ into $DC$'s collection of failure modes}
\STATE { $DC := DC \cup f_l$ } \COMMENT{ this is saying place $f_l$ into $DC$'s collection of failure modes}
\ENDFOR
\ENSURE { $FM(DC) \neq \emptyset$ } \COMMENT{Ensure that DC has a known set of failure modes}
@ -396,7 +396,7 @@ $$ \bowtie: \mathcal{FG} \mapsto \mathcal{DC} $$
\begin{algorithm}[h+]
\caption{$\bowtie(FG)$} \label{alg66}
\caption{Extract Symptoms from Functional Group: $\bowtie(FG)$} \label{alg66}
\begin{algorithmic}[1]

View File

@ -36,8 +36,9 @@
\tableofcontents
\listoffigures
\listoftables
%
\listofalgorithms
%
\cleardoublepage
% Main text