|
|
|
|
Safety_Critical_Machine_Learning |
|
|
|
|
Pattern
Recognition Triple Version Algorithm (PRTVA) is an interpretation, in the
field of Pattern Recognition, of N-Version Programming (NVP). N-Version Programming (NVP), also known as multi-version
programming or multiple-version
dissimilar software, is a method or process in software engineering where
multiple functionally equivalent programs are independently generated from
the same initial specifications. The concept of N-Version Programming was introduced in 1977 by
Liming Chen and Algirdas Avizienis with the central conjecture that the
independence of programming efforts will greatly reduce the probability of
identical software faults occurring in two or more versions of the program.
The aim of NVP is to improve the reliability of software operation by
building in fault tolerance or redundancy. The real equivalence of PRTVA
with NVP exists when PRTVA is applied in FLAT PROBABILISTIC MODE. Actually,
PRTVA does not consider the algorithms with the same priority. PRTVA
evaluates the result of the algorithms in a hierarchical way based on the
selectivity of the Norm used to determine the geometry of the influence field
(Hierarchy of Nom Selectivity). |
|||
|
ALGO |
NORM |
GEN |
REL |
|
ROCKET Linf |
Linf |
V L |
H1 |
|
SHARP |
LIE |
L |
H2 |
|
LASER |
LAS |
H |
H3 |
|
ROCKET L1 |
L1 |
VH |
H4 |
|
|
|
General Synaptics Aerospace_and_Defence_Machine_Learning_Company VAT NUMBER:_IT02670700992 REA NUMBER: GE-503104 Email:_luca.marchese@synaptics.org |
|
|
|
CopyrightŠ 2026 General Synaptics |
