A Novel -Input Voting Algorithm for -by-Wire Fault-Tolerant Systems

Algorithm 1

(1) ; ;

(2) For     to     do  {process the remaining input objects}

(3)   If   ∃   such that with

(4)   Then  

(5)   Else  if   ∃   with   {an empty slot?}

(6)    Then   ; ;save input object in empty slot}

(7)    Else  let   be a minimum of all

(8)      If  

(9)      Then  

(10)     Else   ; ;

(11)      Endif

(12)    Endif

(13)    Endif

(14)   Endfor

(15)    

(16) For     to     do

(17)  If   ∃   such that

(18)  Then   ; if     then  output   and  Exit

(19)  Endif

(20) Endfor

(21) For     to     do  {i.e., there isn’t any result for voting in current cycle}

(22)  

(23) Endfor

(24)  Let   be a minimum of all

(25) If     then  output  

(26) endif