<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Method of Hidden Faults Opposition for FPGA-Based Components of Safety-Related Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>r Droz</string-name>
          <email>5myroslav.drozd@opu.ua</email>
          <email>drozd@ukr.net</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>liy Rom</string-name>
          <email>3romankev@scs.kpi.ua</email>
        </contrib>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The paper is devoted to the problem of hidden faults, which is inherent in safety-related systems aimed at ensuring the functional safety of high-risk facilities to counter accidents. The problem of hidden faults is considered from the perspective of a resource-based approach as a problem of growth from a lower level of replication to the next level of diversification in the development of models, methods and means. Computer systems in critical applications have risen to the level of diversification in the division of the operating mode into normal and emergency, in the input data and structurally functional checkability, which for digital components have become different in these modes. Digital components continue to be traditionally stamped based on matrix structures that reflect the level of replication. The lag of the components from the development of the system creates a problem of hidden faults which can be accumulated during the normal mode and reduce the fault tolerance of the components and the functional safety of the system in emergency mode. We propose a method of counteracting hidden faults by raising components to the level of diversification in the promising field of FPGA designing. The proposed method uses the natural version redundancy inherent in the program code of the FPGA projects with LUT-oriented architecture. The method generates and selects versions of the program code, reducing many hidden faults of short circuits between neighboring inputs of LUT units. Possible hidden faults are eliminated by increasing the checkability of the FPGA project in normal mode and the trustworthiness of the results calculated in emergency mode.</p>
      </abstract>
      <kwd-group>
        <kwd>safety-related system</kwd>
        <kwd>digital component</kwd>
        <kwd>FPGA project</kwd>
        <kwd>LUT unit</kwd>
        <kwd>program code</kwd>
        <kwd>hidden fault</kwd>
        <kwd>resource-based approach</kwd>
        <kwd>growth problem</kwd>
        <kwd>checkability</kwd>
        <kwd>trustworthiness</kwd>
        <kwd>version redundancy</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Copyright © 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction and Related Works</title>
      <p>
        The most important direction in the development of information technologies is their
improvement in the field of critical applications. This area, which is exceptional in
nature, has already acquired a scale commensurate with the living space of mankind.
Power grids and power plants, high-speed ground and air transport, hazardous
chemical production, space technology and weapons are high-risk facilities [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ].
      </p>
      <p>
        Risk assessment includes two factors related to the probability of an accident and
the cost of its consequences. The factor of emergency consequences has a tendency of
constant growth, which is caused by development of objects of high risk in the
direction of their complication and increase of capacity, as well as increase of their
number, density of location and proximity to densely populated areas [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].
      </p>
      <p>
        Only reducing the probability of accidents can counteract the growth of this factor.
This mission is devoted to information technology implemented in safety-related
systems, which, according to international standards, are aimed at "ensuring
functional safety of both the system and the control object for preventing accidents and
reducing the consequences if they occur" [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
      </p>
      <p>
        The challenge in achieving functional safety “is to design the system in such a way
as to prevent dangerous failures or to control them when they arise” [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. This
provision automatically includes hidden faults in the concept of "dangerous failures", as
they pose a problem of their control for safety-related systems and their components
[
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ].
      </p>
      <p>
        The fault control function is related to the development of the concept of
checkability. At an early stage, this concept is known as testability or structural checkability
of the digital circuit, characterizing it from the point of view of simplicity in the
development of tests for fault detection [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ].
      </p>
      <p>
        The structural nature of testability is due to the fact that it is completely determined
by the structure of the digital circuit. The next stage in the development of
checkability is related to on-line testing of digital circuits [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ], where checkability also
shows dependence on input data, which characterizes it as structurally functional. The
definition of self-testing circuits formulated in the theory of designing the totally
selfchecking circuits is known [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ]. Self-testing circuits are evaluated in checkability
taking into account input data [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ].
      </p>
      <p>
        Safety-related systems make a significant contribution to the development of the
concept of checkability of the digital components by diversifying the operating mode
into normal and emergency. Inputs are also included in the diversification process and
become different in these modes. Then the structurally functional checkability of the
digital circuit is converted into a double-mode, which differs in normal and
emergency operation due to different input data. Such development of checkability
converts harmless hidden faults of conventional computers working only in one operating
mode, into dangerous ones. Indeed, a fault hidden throughout the operating mode will
have no effect on the functionality of a regular computer. A hidden fault becomes a
problem for safety-related systems because such faults can be accumulated in normal
mode without causing errors under conditions of insufficient structurally functional
checkability of the circuit, i.e. lack of necessary input data. In the emergency mode,
the checkability is enriched with new input data and creates conditions for the
manifestation of accumulated faults in the form of errors [
        <xref ref-type="bibr" rid="ref18 ref19">18, 19</xref>
        ].
      </p>
      <p>The problem of hidden faults has a long history known from unsuccessful attempts
to detect these faults using imitation modes aimed at recreating emergency conditions.
The activation of such modes often provides for the shutdown of emergency
protections, which has become one of the causes of the Chernobyl disaster.</p>
      <p>
        In addition, history knows many examples of emergency consequences as a
result of unauthorized activation of imitation modes because of human factor or due
to the resulting fault [
        <xref ref-type="bibr" rid="ref20 ref21">20, 21</xref>
        ].
      </p>
      <p>
        The presence of imitation modes creating a real danger to functional safety can
be explained by two reasons:
 the high significance attached to hidden faults, which are feared more than
emergency conditions created by imitation mode;
 lack of confidence in the fault tolerance of the solutions used, on which
functional safety of critical systems and control objects is built [
        <xref ref-type="bibr" rid="ref22 ref23 ref24">22-24</xref>
        ].
      </p>
      <p>The resource-based approach, which explores the integration of the artificial
world created by human into the natural one, refers to the problem of hidden faults
as a growth challenge. This approach identifies three levels in the development of
models, methods and means: replication, diversification and self-sufficiency as a
development goal. It shows the transition of safety-related systems to
diversification and the backlog of their components, which continue to be stamped at a lower
level of replication using matrix structures. Such classification of the problem of
hidden faults determines the ways of its solution by raising the components to the
system level [25, 26].</p>
      <p>One of the most important directions in the development of digital components
for critical systems is associated with FPGA designing. FPGA technologies are also
a prime example of replication level dominance. FPGA chips contain Configurable
Logic Blocks or Logical Elements, prepared iterative array multipliers, and chains
for rapid carry propagation to add parallel codes, the libraries of IP-cores with
matrix structures [27, 28].</p>
      <p>However, FPGA refers to programmable hardware that raises stamped element
matrices to the level of diversification by using the natural version redundancy in
program code of FPGA projects with LUT-oriented architecture [29-31].</p>
      <p>In this architecture, the computing process is organized using LUT units that are
logic function generators. Their arguments arrive at the inputs of the LUT unit. The
description of the logical function is stored in the memory of the LUT unit and
written to this memory in the process of programming the FPGA project as program
code. In the case of four inputs A, B, C and D, the memory of the LUT unit
contains 24 = 16 bits [32, 33].</p>
      <p>Versions of the program code are created for each pair of the LUT units where
output of the first LUT unit is connected to the input of the second one. The signal
between the LUT units may be transmitted by a direct or inverse value using one of
two versions of the program code. The inverse value at the output of the first LUT
unit of the pair is provided by inverting the bits of its memory and changing its
program code accordingly. The obtained inversion at the input of the second LUT
unit of the pair is compensated by changing the program code with replacement bits
of the memory [34].</p>
      <p>This form of redundancy has been used to increase the trustworthiness of the
calculated results by generating program code versions and selecting the best one from
the position of masking the faults between neighboring LUT unit inputs of the
FPGA project [35, 36].</p>
      <p>The selection of the version with the best structurally function checkability of the
LUT units of the FPGA project in the normal mode of the safety-related system or
trustworthiness of the results calculated in the emergency mode is proposed in [37].</p>
      <p>A disadvantage of both solutions using version redundancy of program code is
simulation of calculations on all normal and emergency mode inputs for each
combination of versions generated by the LUT units of the FPGA project. The number of
program code versions is defined as 2Z, where Z is the number of first LUT units of
all pairs.</p>
      <p>For example, in the case of Z = 30 and Z = 60, simulation of calculations
performed in the FPGA project is repeated for each input word of each mode more than
109 and 1018 times, respectively. The number of inputs is defined as 2U, where U is the
number of inputs of the simulated scheme of the FPGA project. For U = 20, the
simulation must be repeated 1015 and 1024 times. Such a large number of iterations
significantly limits the capabilities of the method in the processing of complex circuits. In
addition, the choice of versions that increase the checkability of the FPGA project in
normal mode or the trustworthiness of the results with the onset of emergency mode
helps to reduce a set of the hidden faults, but in general is not the best solution.</p>
      <p>We offer a method to counter hidden faults of the FPGA project taking into
account the peculiarities of this kind of faults. The method allows maximum use of
version redundancy of program code to reduce many possible hidden faults. Section 2
contains the main provisions of the proposed method. Section 3 describes the case
study of the method using the FPGA project on example of the iterative array
multiplier.
2</p>
    </sec>
    <sec id="sec-3">
      <title>Main Provisions of the Suggested Method</title>
      <p>The proposed method uses the synergy of several types of natural version
redundancy. First of all, the method takes into account the natural version redundancy of
safety-related systems, which is evident in their designing for operation in two
essentially different modes: normal and emergency.</p>
      <p>In addition, the method uses version redundancy of hidden fault elimination
solutions. They pose a danger to fault tolerant decisions while meeting two conditions:
accumulation of faults during normal mode and their manifestation in the form of
errors in emergency mode. Therefore, the hidden fault is eliminated if at least one of
the above conditions is excluded. Thus, the resistance to hidden faults can be achieved
with the use of two versions of the solution, which consists in improving the
checkability of LUT units and the trustworthiness of the results calculated on them,
respectively.</p>
      <p>The fault of the short circuit between the two neighboring inputs of the LUT unit
also demonstrates natural version redundancy. It consists of two fault states: its
masking or error manifestation in the case of the same signal values at the neighboring
inputs of the LUT unit and otherwise, respectively. Fault masking increases the
trustBA 00</p>
      <p>BA 00
01
10
11
worthiness of the calculated results, and its manifestation in the form of error
improves the checkability of the LUT unit.</p>
      <p>Versions of the program code allow to control the input of the second LUT unit.
They are assigned to this input directed or inverse value. Change version manages the
state of the fault, showing it or masking for improving checkability of the LUT unit or
the trustworthiness of the results. These improvements can be achieved concurrently,
assigning them to different modes: normal and emergency, respectively.</p>
      <p>The method generates and considers all versions of the program code that can be
created for the second LUT unit of each pair. For example, if only two of the four
LUT unit inputs connected to the outputs of the previous LUT units, then these LUT
units will form two pairs and 4 versions.</p>
      <p>The method distinguishes between three sets MN, ME and MN&amp;E of bits in the
memory of each LUT unit: bits addressable in the normal, emergency, and in both
modes, respectively. Faults which cause errors in bits of both MN and MN&amp;E sets are
not hidden, as can be detected in the normal mode. Therefore, the fault of the short
circuit may be hidden, but if they cause errors only in bits of the ME set and do not
contain errors in bits, addressed in the normal mode.</p>
      <p>The fault circuit between neighboring inputs of the LUT unit maintains proper
access to its memory bits for identical values of these inputs and indicates the remaining
bits in the values corresponding to zero values of the signals.</p>
      <p>Examples of the effect of the short circuit faults on accessing the memory of the
LUT unit are shown in Fig. 1.</p>
      <p>1
1
1
1</p>
      <p>DC
00
01
10
11
0
0
1
0
0
1
1
0
1
1
1
1
1
1
1
1</p>
      <p>b
DC
00
01
10
11
0
0
0
0
1
1
1
1
0
0
0
0
a</p>
      <p>DC</p>
      <p>BA 00
BA 00
01
10
11
01
10
11</p>
      <p>BA 00
01
10</p>
      <p>11
1
1
1
1
0
0
0
0
1
1
1
1
c d e</p>
      <p>Fig. 1. Examples of LUT unit memory: numbers (a) and values (b) of bits and
DC
00
01
10
11
0
1
1
0
10
2
6
10
14
00
01
10
11
11
3
7
11
15
0
0
1
1
DC
00
01
10
11
0
1
1
0
01
1
5
9
1
1
1
1
12</p>
      <p>13
0
4
8
0
1
1
0
memory in cases of shorts between A and B (c), B and C (d), C and D (e) inputs
The numbering of the LUT unit bits and the correct values of bits of memory,
which is programmed with the ABBA16 code, shown in Fig. 1, a and b. The memory
of the LUT unit for cases of shorting inputs A and B, B and C, C and D is shown in
Fig. 1, c, d, e, respectively.</p>
      <p>Shorting the A and B inputs copies the values of bits BA 00 column into the
memory array columns BA 01 and BA 10. BA 11 column bits retain their value. Shorting
the B and C inputs copies the value of bits located at the intersection of column BA
00 and BA 01 with lines DC 00 and DC 10 into bits at the intersection of column BA
00 and BA 10 with a DC 01 and DC 11 lines as well as into bits at the intersection of
column BA 10 and BA 11 with lines DC 00 and DC 10. The bits located at the
intersection of columns BA 10 and BA 11 with lines DC 01 and DC 11 retain their values.
Shorting the C and D inputs copies the values of bits of the DC 00 line into lines DC
01 and DC 10. Bits of the DC 11 lines retain their values. Erroneous bit values are
highlighted in yellow.</p>
      <p>The method performs the following steps:</p>
      <p>Step 1: Determination of all second LUT units of the circuit and for each of them
the set of all versions of program code.</p>
      <p>Step 2. Simulation of calculations executed in FPGA project for all of the input
data, i.e., U times, with determination of the MNE = MN  MN&amp;E and ME bit sets in
memory for each second LUT unit of the pair.</p>
      <p>Step 3. Determination of the MNE and ME sets of bits in the memory for each
version of each second LUT unit of the pair.</p>
      <p>Step 4. Determination of all possible faults of the short circuit between neighboring
inputs of each second LUT unit of the pair for cases where at least one of these inputs
is connected to the output of the previous LUT unit.</p>
      <p>Step 5. Determination of the program codes in the view, distorted under the
influence of any faults. These program codes are generated for each version of each
second LUT unit of pairs and compared with the correct program code versions. The
erroneous bits detected in the sets MNE and ME, form the sets MNE ER and ME ER,
respectively.</p>
      <p>Step 6. The FPGA project program code is generated using versions containing the
minimum number of bits in ME ER sets with MNE ER = .</p>
      <p>Step 7: The resulting program code is compared with the initial and least
successful in the number of bits in the ME ER sets with MNE ER =  to evaluate the capabilities
of the method.</p>
      <p>The method improves the checkability of the FPGA project in the normal mode,
and thus eliminates the hidden faults by choosing versions with sets of MNE ER ≠ . In
case MNE ER = , the method selects the versions with the lowest number of bits in the
ME ER set to reduce the set of hidden faults that manifest themselves in an emergency
mode.</p>
      <p>Reducing many hidden faults, performed in both modes, aimed at improving the
trustworthiness of the results calculated in the emergency mode. From this position,
the trustworthiness of the FPGA project results with respect to hidden faults of the
short circuit between neighboring inputs of LUT units can be estimated taking into
account erroneous memory bits addressed only in emergency mode in the case of
MNE ER = .</p>
      <p>The trustworthiness of the result read from the output of the LUT unit can be
estimated as TLUT = (1 – (AE ER / (3AE ER)) КNE ER)×100%, where AE ER and AE are the
number of bits in the ME ER sets for all three types of short circuit and in the ME set,
respectively, КNE ER = 1 if MNE ER = , and КNE ER = 0 otherwise.</p>
      <p>The trustworthiness of the FPGA project results can be estimated by the arithmetic
average of the TLUT values calculated for all LUT units.</p>
      <p>The contribution that is made to the trustworthiness by the checkability of the LUT
units in the normal mode can be estimated similarly taking into account the error
memory bits of the ME ER set in the case of MNE ER ≠ .</p>
      <p>Comparison of the best solution with the initial project and the least successful
version of the program code shows the effectiveness of the method in the specific
example of FPGA design and the potential of the method, respectively.
3</p>
    </sec>
    <sec id="sec-4">
      <title>Case Study of the Proposed Method</title>
      <p>Experimental verification of the method was carried out using CAD Quartus Prime
18.1 Lite Edition on the example of a study of a 4-bit iterative array multiplier
implemented in Intel Max 10 FPGA 10M50DAF672I7G [38, 39]. The digital circuit
of the obtained FPGA project contains 8 inputs which are supplied with 4-bit
operands, 30 LUT units with four inputs for performing the multiplication operation,
and 8 product outputs. The digital circuit simulation was carried out using the
program implementation of the method. The program was developed in the free
Delphi 10 Seattle demo version [40].</p>
      <p>As initial data, the program uses a description of a digital circuit with an indication
of the connections of its inputs or outputs of previous LUT units to the inputs of each
next LUT unit and the outputs of the circuit. In addition, the number of digital circuit
inputs, the number of LUT units and their program codes are indicated.</p>
      <p>The program presents the results of examining the digital circuit on the main panel,
which is shown in Fig. 2.</p>
      <p>The main panel is invoked by pressing the «Start» key and allows to complete the
program on «Exit» command. The main panel allows to view the values of the
memory bits for all LUT units operating at different threshold values S, dividing the
input data of the normal and emergency modes.</p>
      <p>The values of the factors smaller than the S threshold refer to the normal mode, and
the rest to emergency one. The "S: 2 - 9" key determines 8 threshold values from 2 to
9. Each press of this key shifts the range of S values by one to the maximum: "S: 8
15" and then the value "S: 2 - 9". The "LUT # 22" key specifies the number 22 of the
considered LUT unit. Clicking on this key allows to proceed to the LUT unit with the
following number. The largest number is replaced by the first. Bits addressable in the
normal and in emergency mode only, colored in green and yellow, respectively. Blue
color indicates addressing in both modes.</p>
      <p>The lower part of the panel shows the results of the proposed method for each
value of the S threshold. Line "V" shows the decimal number of the best version of
the program code. The binary code dcba2 of the version number determines the
inverted inputs of the second LUT unit by the unit values of the corresponding bits.</p>
      <p>For example, version 13 = 11012 means inverting inputs D, C and A. Number
0 = 00002 indicates the preservation of the source program code [41].</p>
      <p>The next three lines «V.I», «V.B» and «V.W» evaluate the trustworthiness of the
calculated results to the initial, the best and the least successful version of the program
code for FPGA project, respectively. The numerator includes the trustworthiness of
the results calculated in the FPGA project, and the denominator contains the
contribution that is made to the trustworthiness of the checkability of the LUT units in
normal mode. The last line in the numerator and denominator shows the gain in the
% 100
90
80
70
60
50
40
30
20
10
0
S
trustworthiness of the best solution compared to the initial project and the least
successful version of the program code, respectively.</p>
      <p>Diagrams of the dependence in trustworthiness of the results on the S threshold for
the best, initial and least successful solution are shown in Fig. 3.</p>
      <p>2
3
4
5
6
7
8
9</p>
      <p>Diagrams show a tendency to increase trustworthiness of the results with an
increase in the S threshold.</p>
      <p>Therefore, it is important that the greatest gain in the best solution obtained by the
proposed method is achieved for small threshold values that are typical for circuits
operating in normal mode at a noise level. For S = 2 and S = 3, the trustworthiness of
the results increases relative to the initial program code from 59% to 84% and from
64% to 87%, i.e. by 25% and 23%, respectively.
4</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>FPGA designing, which is a promising direction in the development of digital
components for safety-related systems, opens up new possibilities for solving the
hidden fault problem inherent in such systems. The programmability of FPGA
projects allows to solve this problem as a growth challenge by raising the components
to the level of diversification, where critical systems are located in operating modes,
input data and digital circuit checkability.</p>
      <p>The proposed method uses the version redundancy in the program code of FPGA
projects with a LUT-oriented architecture to reduce the set of hidden faults in the
short circuit of neighboring inputs of the LUT units.</p>
      <p>Such faults distort the addressing of the memory bits of the LUT units. Memory
bits read at the wrong address may have erroneous values that reduce the
trustworthiness of the calculated results.</p>
      <p>A hidden fault is dangerous with errors that are not detected in normal mode and
distort the results in emergency one.</p>
      <p>The method reduces the number of hidden faults in two ways. The first way is to
search for each LUT unit the program code versions, showing a failure in the normal
mode. The second way applies to LUT units for which there are no such version, and
chooses the version with the least amount of erroneous values in bits, addressed only
in emergency mode.</p>
      <p>The advantage of the proposed method is its low complexity, limited not by the set
of all versions of the FPGA project program code, but by the set of LUT units with
mutually independent examination of their program codes.</p>
      <p>Further research is planned in the direction of expanding the circle of problems
which can be identified and solved as a growth challenge in relation to safety-related
systems and their components based on the development and practical application of
the concepts of checkability and natural version redundancy, in particular in FPGA
designing.
25. Drozd, J., Drozd, A., Al-dhabi, M.: A resource approach to on-line testing of computing
circuits. In: EWDTS 2015 - IEEE East-West Design &amp; Test Symposium, Batumi, Georgia,
pp. 276-281 (2015) doi: 10.1109/EWDTS.2015.7493122
26. Drozd, O., Kharchenko, V., Rucinski, A. et. al.: Development of Models in Resilient
Computing. In: DESSERT 2019 - 10th IEEE International Conference on Dependable Systems,
Services and Technologies, Leeds, UK, pp. 2-7 (2019) doi:
10.1109/DESSERT.2019.8770035
27. Tyurin, S.F., Grekov, A.V., Gromov, O.A.: The principle of recovery logic FPGA for
critical applications by adapting to failures of logic elements. World Applied Sciences Journal,
328-332 (2013) doi: 10.5829/idosi.wasj.2013.26.03.13474
28. Jaecheon Jung, Ibrahim Ahmed: Development of FPGA-based reactor trip functions using
systems engineering approach, Nuclear Engineering and Technology, March 2016, pp. 2-11
(2016) doi: 10.1016/j.net.2016.02.011
29. Palagin, A., Opanasenko, V.: The implementation of extended arithmetic’s on FPGA-based
structures. In: IDAACS 2017 - 9th IEEE International Conference on Intelligent Data
Acquisition and Advanced Computing Systems: Technology and Applications, vol. 2,
Bucharest, Romania, pp. 1014-1019 (2017) doi: 10.1109/IDAACS.2017.8095239
30. Chernov, S., Titov, S., Chernova, L. et. al.: Algorithm for the simplification of solution to
discrete optimization problems. Eastern-European Journal of Enterprise Technologies 3 (4),
1-12 (2018) doi: https://doi.org/10.15587/1729-4061.2018.133405
31. Zashcholkin, K., Ivanova, O.: The control technology of integrity and legitimacy of
LUToriented information object usage by self-recovering digital watermark. In: CEUR
Workshop Proceedings, vol. 1356, pp. 498-506 (2015)
32. Cyclone II Architecture. Cyclone II Device Handbook Version 3.1.-Altera Corporation
(2007) http://www.altera.com/literature/hb/cyc2/cyc2_cii51002.pdf
33. Toshinori, S.: Basic Knowledge to Understand FPGAs. In: Principles and Structures of</p>
      <p>FPGAs, H. Amano (edit), Springer, USA, New-York, pp. 1-22 (2018)
34. Zashcholkin. K., Ivanova, O.: LUT-object integrity monitoring methods based on low
impact embedding of digital watermark. In: TCSET 2018 - International Conference
“Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering,
Lviv-Slavske, Ukraine, pp. 519-523 (2018) doi: 10.1109/TCSET.2018.8336255
35. Drozd, A., Drozd, M., Kuznietsov, M.: Use of Natural LUT Redundancy to Improve
Trustworthiness of FPGA Design. In: CEUR Workshop Proceedings, vol. 1614, pp.
322331 (2016)
36. Pleskacz, W., Jenihhin, M., Raik, J. et. al.: Hierarchical Analysis of Short Defects between
Metal Lines in CMOS IC. In: 11th Euromicro Conference on Digital System Design
Architectures, Methods and Tools, Parma, Italy, pp. 729-734 (2008) doi: 10.1109/DSD.2008.98
37. Drozd, A., Drozd, M., Martynyuk, O., Kuznietsov, M.: Improving of a Circuit Checkability
and Trustworthiness of Data Processing Results in LUT-based FPGA Components of
Safety-Related Systems. In: CEUR Workshop Proceedings, vol. 1844, pp. 654-661 (2017)
38. Intel Quartus Prime Standard Edition User Guide: Getting Started,
https://www.intel.com/content/dam/www/programmable/us/en/pdfs/literature/ug/ug-qpsgetting-started.pdf, last accessed 2019/03/20
39. Max 10 FPGA Device Architecture (2017), https://www.intel.com
/content/dam/www/programmable/us/en/pdfs/literature/hb/max-10/m10_architecture.pdf,
last accessed 2019/03/20
40. Delphi 10 Seattle: Embarcadero (2015) https://www.embarcadero.com/ru/products/delphi/
41. Drozd, O., Kuznietsov, M., Martynyuk, O., Drozd, M.: A method of the hidden faults
elimination in FPGA projects for the critical applications. In: DESSERT 2018 - 9th IEEE
International Conference on Dependable Systems, Services and Technologies, Kyiv,
Ukraine, pp. 231-234 (2018) doi: 10.1109/DESSERT.2018.8409131</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>International</given-names>
            <surname>Atomic Energy Agency</surname>
          </string-name>
          ,
          <article-title>Evaluation of the Status of National Nuclear Infrastructure Development</article-title>
          ,
          <source>IAEA Nuclear Energy Series No. NG-T-3</source>
          .2,
          <string-name>
            <surname>IAEA</surname>
          </string-name>
          , Vienna (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hiromoto</surname>
            ,
            <given-names>R. E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sachenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kochan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          et. al.:
          <article-title>Mobile Ad Hoc Wireless Network for Pre- and Post-Emergency Situations in Nuclear Power Plant</article-title>
          .
          <source>In: WS 2014 - 2nd IEEE International Symposium on Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems</source>
          , Offenburg, Germany, pp.
          <fpage>92</fpage>
          -
          <lpage>96</lpage>
          (
          <year>2014</year>
          ) doi: 10.1109/IDAACS-SWS.
          <year>2014</year>
          .6954630
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ivanchenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kharchenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moroz</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          et. al.:
          <article-title>Risk Assessment of Critical Energy Infrastructure Considering Physical and Cyber Assets: Methodology and Models</article-title>
          .
          <source>In: IDAACS 2018 - 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications</source>
          , Lviv, Ukraine, pp.
          <fpage>225</fpage>
          -
          <lpage>228</lpage>
          (
          <year>2018</year>
          ) doi: 10.1109/IDAACS-SWS.
          <year>2018</year>
          .8525594
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>D. J.</given-names>
          </string-name>
          : Reliability, Maintainability and Risk.
          <source>Practical Methods for Engineers, 9th Edition</source>
          ,
          <string-name>
            <surname>Butterworth-Heinemann</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>International</given-names>
            <surname>Atomic Energy Agency</surname>
          </string-name>
          ,
          <article-title>On-line Monitoring for Improving Performance of Nuclear Power Plants, Part 2: Process and Component Condition Monitoring and Diagnostics</article-title>
          ,
          <source>IAEA Nuclear Energy Series No. NP-T-1</source>
          .2,
          <string-name>
            <surname>IAEA</surname>
          </string-name>
          , Vienna (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Smith</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simpson</surname>
            <given-names>K.</given-names>
          </string-name>
          :
          <source>The Safety Critical Systems Handbook, 4th Edition</source>
          , ButterworthHeinemann (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>International</given-names>
            <surname>Electrotechnical</surname>
          </string-name>
          <string-name>
            <surname>Commission</surname>
          </string-name>
          , Nuclear Power Plants:
          <article-title>Instrumentation and Control for Systems Important</article-title>
          to Safety - General
          <source>Requirements for Systems, Rep. IEC 61513</source>
          ,
          <string-name>
            <surname>IEC</surname>
          </string-name>
          ,
          <string-name>
            <surname>Geneva</surname>
          </string-name>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Efanov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lykov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osadchy</surname>
          </string-name>
          , G.:
          <article-title>Testing of relay-contact circuits of railway signalling and interlocking</article-title>
          . In: EWDTS 2017
          <string-name>
            <surname>- IEEE East-West Design</surname>
            and
            <given-names>Test</given-names>
          </string-name>
          <string-name>
            <surname>Symposium</surname>
          </string-name>
          , Novi Sad, Serbia, pp.
          <fpage>242</fpage>
          -
          <lpage>248</lpage>
          (
          <year>2017</year>
          ) doi: 10.1109/EWDTS.
          <year>2017</year>
          .8110095
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoniuk</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikul</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Hidden faults in FPGA-built digital components of safety-related systems</article-title>
          .
          <source>In: TCSET</source>
          <year>2018</year>
          - 14th International Conference “
          <article-title>Modern problems of radio engineering, telecommunications and computer science</article-title>
          , Lviv-Slavsko, Ukraine, pp.
          <fpage>805</fpage>
          -
          <lpage>809</lpage>
          (
          <year>2018</year>
          ) doi: 10.1109/TCSET.
          <year>2018</year>
          .8336320
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hahanov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Litvinova</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obrizan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gharibi</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Embedded method of SoC diagnosis</article-title>
          . Elektronika in Elektrotechn, no.
          <issue>8</issue>
          ,
          <issue>3</issue>
          -
          <fpage>8</fpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Matrosova</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikolaeva</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kudin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>PDF testability of the circuits derived by special covering ROBDDs with gates</article-title>
          .
          <source>In: EWDTS 2013 - IEEE East-West Design and Test Symposium</source>
          ,
          <article-title>Rostov-on-</article-title>
          <string-name>
            <surname>Don</surname>
          </string-name>
          , Russia, pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          (
          <year>2013</year>
          ) doi: 10.1109/EWDTS.
          <year>2013</year>
          .6673183
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Coppad</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sokolov</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bystrov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yakovlev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Online Testing by Protocol Decomposition</article-title>
          .
          <source>In: IOLTS - 12th IEEE International On-Line Testing Symposium</source>
          , Como, Italy, pp.
          <fpage>263</fpage>
          -
          <lpage>268</lpage>
          (
          <year>2006</year>
          ) doi: 10.1109/IOLTS.
          <year>2006</year>
          .45
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoshchuk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikul</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , Al-dhabi, M.:
          <article-title>Objects and Methods of OnLine Testing: Main Requirements and Perspectives of Development</article-title>
          . In: EWDTS 2016
          <string-name>
            <surname>- IEEE East-West</surname>
            <given-names>Design</given-names>
          </string-name>
          &amp; Test
          <string-name>
            <surname>Symposium</surname>
          </string-name>
          , Yerevan, Armenia, pp.
          <fpage>72</fpage>
          -
          <lpage>76</lpage>
          (
          <year>2016</year>
          ) doi: 10.1109/EWDTS.
          <year>2016</year>
          .7807750
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>D. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metze</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Design of Totally Self-Checking Circuits for n-out-of-m Codes</article-title>
          .
          <source>IEEE Trans. on Computers</source>
          , vol. C-
          <volume>22</volume>
          ,
          <fpage>263</fpage>
          -
          <lpage>269</lpage>
          (
          <year>1973</year>
          ) doi: 10.1109/T-C.
          <year>1973</year>
          .223705
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Metra</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schiano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Favalli</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricco</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Self-checking scheme for the on-line testing of power supply noise</article-title>
          .
          <source>In: DATE 2002 - Design</source>
          , Automation and Test in Europe Conference, Paris, France, pp.
          <fpage>832</fpage>
          -
          <lpage>836</lpage>
          (
          <year>2002</year>
          ) doi: 10.1109/DATE.
          <year>2002</year>
          .998395
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Chakrabarty</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Swaminathan</surname>
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Built-in self-testing of high-performance circuits using twisted-ring counters</article-title>
          .
          <source>In: ISCAS 2000 - IEEE International Symposium on Circuits and Systems</source>
          , Geneva, Switzerland (
          <year>2000</year>
          ) doi: 10.1109/ISCAS.
          <year>2000</year>
          .857029
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kondratenko</surname>
            ,
            <given-names>Y.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozlov</surname>
            ,
            <given-names>O.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Topalov</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gerasin</surname>
            ,
            <given-names>O.S.</given-names>
          </string-name>
          <article-title>Computerized system for remote level control with discrete self-testing</article-title>
          .
          <source>In: CEUR Workshop Proceedings Open Access</source>
          , vol-
          <volume>1844</volume>
          , pp.
          <fpage>608</fpage>
          -
          <lpage>619</lpage>
          (
          <year>2017</year>
          ) http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1844</volume>
          /10000608.pdf
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kharchenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoshchuk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sulima</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Checkability of the digital components in safety-critical systems: problems and solutions</article-title>
          . In: EWDTS 2011
          <string-name>
            <surname>- IEEE East-West</surname>
            <given-names>Design</given-names>
          </string-name>
          &amp; Test
          <string-name>
            <surname>Symposium</surname>
          </string-name>
          , Sevastopol, Ukraine,
          <year>2011</year>
          , pp.
          <fpage>411</fpage>
          -
          <lpage>416</lpage>
          doi: 10.1109/EWDTS.
          <year>2011</year>
          .6116606
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Antoshchuk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drozd</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          et. al.:
          <article-title>Checkable FPGA Design: Energy Consumption, Throughput and Trustworthiness</article-title>
          . In: Green IT Engineering: Social,
          <article-title>Business and Industrial Applications, Studies in Systems, Decision and Control</article-title>
          , vol.
          <volume>171</volume>
          , Berlin, Heidelberg: Springer International Publishing, pp.
          <fpage>73</fpage>
          -
          <lpage>94</lpage>
          (
          <year>2019</year>
          ) doi: 10.1007/978-3-
          <fpage>030</fpage>
          -00253-
          <issue>4</issue>
          _
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>The true toll of the Chernobyl disaster</article-title>
          ,
          <source>BBC Future</source>
          (
          <year>2019</year>
          ) https://www.bbc.com/future/article/20190725-will
          <article-title>-we-ever-know-chernobyls-true-death-toll</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Gillis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>The Apocalypses that Might Have Been</article-title>
          . [Online]. Available: https://www.damninteresting.
          <article-title>com/the-apocalypses-that-might-have-been/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Edstrom</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tilevich</surname>
          </string-name>
          , E.:
          <article-title>Reusable and Extensible Fault Tolerance for RESTful Applications</article-title>
          . In: 11th International Conference on Trust,
          <source>Security and Privacy in Computing and Communications</source>
          , Liverpool, UK, pp.
          <fpage>737</fpage>
          -
          <lpage>744</lpage>
          (
          <year>2012</year>
          ) doi: 10.1109/TrustCom.
          <year>2012</year>
          .244
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Atamanyuk</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kondratenko</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Computer's Analysis Method and Reliability Assessment of Fault-Tolerance Operation of Information Systems</article-title>
          .
          <source>In: CEUR-WS</source>
          , vol.
          <volume>1356</volume>
          ,
          <string-name>
            <surname>Lviv</surname>
          </string-name>
          , Ukraine, pp.
          <fpage>507</fpage>
          -
          <lpage>522</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Romankevich</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feseniuk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maidaniuk</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romankevich</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Fault-tolerant multiprocessor systems reliability estimation using statistical experiments with GL-models</article-title>
          .
          <source>In: Advances in Intelligent Systems and Computing</source>
          , vol.
          <volume>754</volume>
          , pp.
          <fpage>186</fpage>
          -
          <lpage>193</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>