<!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>Models and Methods for Determining Application Performance Estimates in Distributed Structures</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Viktor Grechaninov</string-name>
          <email>grechaninov@nas.gov.ua</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksandr Khoshaba</string-name>
          <email>oleksandr.khoshaba@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hennadii Hulak</string-name>
          <email>h.hulak@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuliia Zhdanova</string-name>
          <email>y.zhdanova@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Iryna Melnyk</string-name>
          <email>iy.melnyk@kubg.edu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Borys Grinchenko Kyiv University</institution>
          ,
          <addr-line>18/2 Bulvarno-Kudriavska str., Kyiv, 04053</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute of Mathematical Machines and Systems</institution>
          ,
          <addr-line>42 Glushkova ave., Kyiv, 03187</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>134</fpage>
      <lpage>141</lpage>
      <abstract>
        <p>The method of evaluating the operation of service programs at nodes of the distribution system is proposed, which consists in the use of a predictive control model, is proposed. A general analysis was carried out between the use of one of the existing and reviewed methods of determining the evaluations of nodes in distributed systems based on models with consideration and prognostic control, where their main characteristics are considered. Features are presented of using PID regulators based on models of dynamic systems are analyzed. The experimental results of the proposed method of determining performance evaluations of applied applications in distributed structures based on the predictive control model are described.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Predictive control model</kwd>
        <kwd>distributed systems</kwd>
        <kwd>proportional-integral-differential</kwd>
        <kwd>PID</kwd>
        <kwd>regulator</kwd>
        <kwd>automated control system</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Currently, the use of applications in distributed
structures rather than monolithic ones is gaining
more and more popularity. The need to use
distributed applications based on modern software
and technical complexes is caused not only by the
spread of large data centers of cloud providers, but
also by the increasingly frequent emergence of
corporate networks in commercial and budget
organizations. In this connection, there are
problems related to the assessment of efficiency
of the use of applications and security in the work
of computing and network resources of the
corporate network [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The most common
problems include changing the estomates of the
efficiency and productivity of nodes of a
distributed system as a result of its modernization
with software and technical means, installing
patches on the operating systems of nodes, adding
new ones, as well as studying the software code of
existing service applications, implementing
scripts for performing work on deploying
information structures, putting additional nodes
into operation, etc. [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
      </p>
      <p>In the sphere of security of systems, there is a
problem of identifying unauthorized actions by
intruders. Such actions lead to a change in the
evaluations of the efficiency and productivity of
the nodes in relation to the reference (previously
measured) values.</p>
      <p>Using model-based assessments in existing
industrial or IT infrastructures to configure
autoscaling of corporate network nodes also results in
significant cost savings.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Research Purpose</title>
      <p>The purpose of the paper is to study the
functioning of service applications on the nodes
of a distributed structure using dynamic systems
and the Model of Predictive Control (MPC). The
study includes obtaining estimates of service
application performance in a distributed system
based on load effects by means of a series of
requests to the object of study, which are formed
using reference trajectories.</p>
    </sec>
    <sec id="sec-3">
      <title>Method of Determining Estimates</title>
      <p>on Nodes in Parallel and</p>
    </sec>
    <sec id="sec-4">
      <title>Distributed Structures</title>
      <p>Method
of
solving
the
problems
of
determining the estimates of the use of this
function on nodes in parallel and distributed
structures</p>
      <p>
        In order to solve the problems of determining
the estimates of node performance, models of
parallel and
distributed
structures
based
on
reference algorithms for problem solving are
proposed [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1–4</xref>
        ]. In this regard, the determination
of node performance estimates, which is based on
the model of a parallel system, uses a reference
sequential algorithm for solving some problem A
by an application in time T [
        <xref ref-type="bibr" rid="ref2 ref4">2, 4</xref>
        ]. In this case, the
acceleration estimate is used, which is defined as:
characterized by the presence of a schedule and is
defined as:
      </p>
      <p>ℎ ( ):  + → {0,1}.</p>
      <p>At the same time, hi(t) = 1 if the application
located on the node at time t is available to solve
task A. Otherwise, if hi(t) = 0, then the application
on the node at time t is unavailable.</p>
      <p>
        Performance estimates for applications located
on a distributed structure take other ratios. Thus,
for a model with a schedule of a distributed
structure, the efficiency assessment takes the form
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]:
 =
 0

where T0 is solution time of reference problem А
by the application on one device (node) using the
fastest sequential algorithm.
      </p>
      <p>
        Acceleration S shows how many times the
application's problem solving time can be reduced
by using a parallel structure [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        The next assessment of the performance of
applications on nodes in parallel structures is
efficiency, which is defined [
        <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
        ] as:
 =
      </p>
      <p>=</p>
      <p>.</p>
      <p>The described model of using this function on
a parallel
structure is simple to
calculate
estimates. However, in this model, the value of
their estimates is determined
only
after the
completion of the task, when the total time Т is
known. In addition, the model requires knowledge
of the time of solving the problem by the best from
a set of sequential algorithms Т0 on one of the
nodes on the parallel structure.</p>
      <p>Another approach to using similar models for
job evaluations employs distributed structures in
connection with two aspects. Firstly, nodes in
distributed structures due to their heterogeneity
(3)
(4)
(5)
(6)
  =
 ( )
 ( )
where T(A) is the reference time for solving the
task А by the application.</p>
      <p>The reference time  ( ) is the time of solving
task А by the ith application on the node using the
fastest sequential algorithm, where  ( ) &gt; 0.</p>
      <p>
        Also, for applications located on a distributed
structure, such additional estimates as [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ] are
introduced: the performance of the reference
system
      </p>
      <p>
        and the complexity of the task. The
calculation of the reference performance of the
system
π(A,t)
πi(A,t) is called [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] the performance of the ith node
time for solving problem A is called the value T(A)
[
        <xref ref-type="bibr" rid="ref5 ref6 ref7">5–7</xref>
        ], which is determined by the following
relation:
 ( ) =  : ∫
      </p>
      <p>( ,  ) .

distributed structure with a schedule (8), the
resources</p>
      <p>Therefore, it is incorrect to enter the concept of
acceleration to the applications in the distributed
structure, since it is not clear about which node is
to calculate the acceleration parameter itself. On
this basis, a more general concept of relative
acceleration is introduced, which is determined as
follows:
 ( 1,  2) =
 1
 2</p>
      <p>The ratio (10) shows the evaluation of the
acceleration S for the model with the schedule R1
relative to the other system R2 as the ratio of their
time of solving the problem A on the applications
in the distributed structure. Also, for a schedule
model, it is customary to perform the acceleration
evaluation S for each node of the distributed
structure as follows:
  =
 

 ( ,  ) = ∑   ( )ℎ ( ) = (⃗ ( ), ℎ⃗( )), (7)
fulfilled.
the set:
where with full availability of applications on
nodes hi(t) ≡ 1 in the process of solving the
problem
and
with
the
same
performance of the distributed structure
will
coincide with the reference performance of the
parallel structure as the condition  ∙  0 will be</p>
      <p>At the same time, the model with the schedule
ℜ for solving problems from the set Λ is called
 = &lt; ⃗ ( ), ℎ⃗( ) &gt;.
(8)
(9)
(10)
(11)
as the ratio of the reference time of solving
problem А to the time of solving this problem in a
distributed structure based on a schedule model.
4.</p>
    </sec>
    <sec id="sec-5">
      <title>Method of Solving the Problem</title>
    </sec>
    <sec id="sec-6">
      <title>Determining the Performance</title>
      <p>
</p>
      <p>The proposed method of solving the problem
of determining the performance of applications in
distributed structures is based on the following
aspects. Firstly, such a model of research as a</p>
      <p>Therefore, evaluations of the study of an object
(service applications) and the regulator of load
effects in distributed structures (Fig. 1) can be
obtained in this way:</p>
      <p>To determine the main characteristics of the
object of study (k, θ, τ) it is necessary to
perform its identification according to the
models (13–17).</p>
      <p>To determine the main characteristics of the
regulator, the calculations according to the
model (18) are performed.
estimate of the object of research and regulator
of load effects in distributed structures</p>
      <p>Although this method has become widely used
since the early 80’s of the 20th century, it has today
been</p>
      <p>improved
management
with
and
practiced
in</p>
      <p>classical
negative
feedback.</p>
      <p>This
method is based on predicting the behavior of the
used to adjust inaccuracies related to external
obstacles and inaccuracy of the
mathematical
model in relation to the control object. To do this,
a regulator is created that uses the empirical model
of the control object to predict its further behavior.
proposed method of determining the evaluations
of applications at nodes in a distributed structure
Characteristics
The nature of the
submission of a
distributed structures is carried out, which is
reduced to the maximization or minimization in
time of the selected criterion.</p>
      <p>Dynamic optimization, which is used in the
method of solving the problem
differential algebraic equations (DEA) to perform
numerical solutions. One of the most popular
control (MPC) method (Fig. 2). The main purpose
of using</p>
      <p>MPC is to</p>
      <p>minimize the difference
between the given value of the controlled variable
and the predictions of the model.
optimization of the research object (service
applications in a cluster structure)</p>
      <p>The model of the control object is usually
chosen to be linear, but in this paper we will show
the operation of control with predictive models on
a non-linear model (Fig. 5). In the case of
determining the estimates of applications in
distributed systems, a given non-linear model of
the control object (service applications) is set as
the trajectory of the reference effect of the load
(u). As a result of this formalization of the subject
area, we will get the following model of predictive
control in the form of the variable y (Fig. 2):
 ( )</p>
      <p>2 + 2
 ( )
 
 (
(− )
+ 1)
parameters as transmission coefficient (k), delay
time (θ), and time constant (τ) are most often
determined.
Fig. 1</p>
      <p>with the calculated parameters of the
regulator (18, Fig. 3) and the research object (13,
Fig. 1) is denoted as y.</p>
    </sec>
    <sec id="sec-7">
      <title>5. Peculiarities of using PID</title>
    </sec>
    <sec id="sec-8">
      <title>Regulators based on Models of Dynamic Systems</title>
      <p>Models of dynamic systems often have a delay
link in their structure, the cause of which is the
peculiarities of technological processes. Also, in
dynamic systems, the impact on the research
object and the reaction of the research object is a
function of time (12). Therefore, the reaction to
the impact of the
research
object
can
be
determined both by the current and previous
values of the impact on it. As a result, the dynamic
system has inertia.</p>
      <p>
        At the same time, during the development of
such systems with a delay, rather efficient PIDs
and some other regulators with a special structure
are mostly used. Also the advantage in use is
given to the PID family of regulators due to their
simplicity, efficiency and prevalence. It is known
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] that earlier in more than 90% of cases when
using technological process control systems in
dynamic systems, PID regulators were used
(Fig. 3).
      </p>
      <p>
        During work with PID regulators, more than a
hundred options for determining their settings
were created [
        <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16">13–16</xref>
        ]. This number is determined
by the difference in the reference models of the
dynamics of technological processes, the quality
criteria of transient processes, the conditions of
their application, the accuracy and reliability of
the algorithms for calculating and optimizing their
parameters. The basis of the use of regulators in
dynamic structures is the study of object control
systems, in which the delay time for a change in
the controlling effect takes most of the time for the
reaction of the object of study.
      </p>
      <p>In the classical theory of automatic control, the
regulator structure is selected from the control
object model, for example (13)–(17). At the same
time, difficult control objects require the use of
complex regulators. However, in practice, in the
vast majority of cases, regulation is reduced to the
use of PID regulators according to the model:
1
  
 =   (1 +
+    ).</p>
      <p>(18)</p>
      <p>PID controllers do not always provide the
required quality of regulation, but due to the
simplicity of their structure and a large number of
theoretical
and
practical
methods
of their
adjustment, PID controllers are the main ones in
practical application.</p>
      <p>
        Several types of criteria are used to assess the
quality of transient processes: direct, integral and
frequency. The most important direct indicators
are the maximum deviation module |ymax| and
adjustment time Tp. Among others, integral and
frequency indicators are most often used. For
example, among frequency indicators of quality
(MS), the sensitivity function [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] is very often
used, which is defined as follows:
  = 

|
      </p>
      <p>1
 ( ∙  ) ∙  ( ∙  ) + 1
|
(19)
where P(s) and C(s) are transmission functions of
the control object and regulator; ω is circular
frequency; j is an imaginary unit.</p>
    </sec>
    <sec id="sec-9">
      <title>6. Experimental Research</title>
      <p>Experimental studies of the models and the
for conducting experimental research and data
collection, which consists of the following main
components: a benchmark, a load balancer and
nodes of a distributed (cluster) structure.</p>
      <p>Let’s consider the main tasks performed by
each of the main components. The benchmark,
according to the reference trajectory of the load
impact u (Fig. 2), ensured the generation of a
series of requests during certain time intervals for
the load balancer. The load balancer, in turn,
performed traffic redirection (a series of requests)
according to the algorithm of uniform distribution
to the nodes of the cluster structure. After that, the
benchmark received a series of requests from the
load balancer and recorded the response time
(RT). As a result, an assessment of the load effects
(LE) on the service programs of nodes of the
cluster structure was used, which was performed
as follows:
  =  ⋅ 
  
  
(20)
where RTi is time of processing and transportation
of a series of requests to the research object; PTi
is the period between the generation of successive
series of requests for the research object; k is a
correction factor equal to 10.</p>
      <p>Assessment of load effects (LE) corresponds
to the notation y, which is shown in Fig. 2.</p>
      <p>The experimental data obtained in this way
were analyzed. The results of the analysis of the
use of the predictive control model are shown in
Fig. 5.
following task was set: based on the given values
of the reference effects (u), to obtain the values of
the estimates of the load effects. Next, it was
necessary to build and optimize the model based
on the transmission function (13) and the PID
regulator.</p>
      <p>The assessment of load effects (20) is shown
in the graph of Fig. 5 and corresponds to the
inscription</p>
      <p>Process</p>
      <p>Data. In
the
course
experimental studies, the
estimate (20)</p>
      <p>of
was
obtained as a reaction of the system (Fig. 2) to the
load effects u (the lower part of the graph in
Fig. 5). The values obtained as a result of
optimization are shown in Fig. 5 and labeled as
Optimized FOPDT (upper part of the graph).</p>
      <p>According to the analysis shown in Fig. 5 for
the research object (service applications) the
transfer function was determined according to
(13) with the parameters shown in Table 2. The
root mean square error based on the found
parameters (Table 2) was 7589.8.
 =
⋅ 100 % .</p>
      <p>Values of the
parameters
(initial values)
where R0 is the estimate of the root mean square
error obtained as a result of optimization of the
parameters of the transition function of the
research object and the PID of the regulator; R is
initially obtained estimate of the root mean square
error as a result of determining the parameters of
the transition function of the research object and
the PID regulator.</p>
      <p>In this work, the use of the method of control
management (MPC, Fig. 2) made it possible to
increase the accuracy of the predictive model by
70.22%.</p>
      <p>The following software was used during the
experimental research: the Ubuntu version 21.04
operating system, a cluster structure based on
MicroK8s and Docker containers.</p>
    </sec>
    <sec id="sec-10">
      <title>7. Conclusions</title>
      <p>So the presentation of distributed structures as
dynamic systems allows:
 To receive information about existing changes
(for improvement or deterioration) of
qualitative and quantitative assessments of the
main characteristics of applications on nodes
contained in distributed (cluster) structures in
connection with their purposeful (sanctioned)
changes in the software code or changes in the
software settings environment (operating
systems, system utilities).
 Create an automatic control system that works
in real time by determining the optimal
characteristics of the transfer function of the
model of the research object and the PID
regulator.
 On the basis of the obtained automatic control
system, determine the margin of safety of the
distributed (cluster) structure due to the
appearance of unaccounted for external or
internal excitations (noises) on the research
objects or the software environment.</p>
    </sec>
    <sec id="sec-11">
      <title>8. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vladymyrenko</surname>
          </string-name>
          , et al.,
          <article-title>Analysis of Implementation Results of the Distributed Access Control System, in VI International Scientific</article-title>
          and Practical Conference Problems of Infocommunications.
          <source>Science and Technology</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>39</fpage>
          -
          <lpage>44</lpage>
          . doi:
          <volume>10</volume>
          .1109/PICST47496.
          <year>2019</year>
          .
          <volume>9061376</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Skladannyi</surname>
          </string-name>
          ,
          <article-title>Security Rating Metrics for Distributed Wireless Systems</article-title>
          ,
          <source>in 8th International Conference on “Mathematics. Information Technologies</source>
          . Education,” vol.
          <volume>2386</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>222</fpage>
          -
          <lpage>233</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Astapenya</surname>
          </string-name>
          , et al.,
          <article-title>Analysis of Ways and Methods of Increasing the Availability of Information in Distributed Information Systems</article-title>
          , in 8th International Conference on Problems of Infocommunications,
          <source>Science and Technology</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>174</fpage>
          -
          <lpage>178</lpage>
          . doi:
          <volume>10</volume>
          .1109/PICST54195.
          <year>2021</year>
          .
          <volume>9772161</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Afanasiev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Posypkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <article-title>Analytical Model for Evaluating the Performance of Distributed Systems</article-title>
          ,
          <source>Software Products and Systems</source>
          , vol.
          <volume>4</volume>
          ,
          <issue>2009</issue>
          , pp.
          <fpage>60</fpage>
          -
          <lpage>64</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <source>Mathematical Model of Performance Characteristics of Distributed Computing Systems, in 50th scientific conference of MIPT</source>
          ,
          <year>2007</year>
          , pp.
          <fpage>86</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <source>On Performance Characteristics of Distributed Systems, in 51st scientific conference of MIPT</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <article-title>Models and algorithms for load distribution</article-title>
          .
          <source>Algorithms based on QS networks, Information technologies and computing systems</source>
          , vol.
          <volume>3</volume>
          ,
          <issue>2009</issue>
          , pp.
          <fpage>33</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Posypkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <article-title>On the Concept of Acceleration and Efficiency in Distributed Systems</article-title>
          , in All-Russian Scientific Conference “
          <article-title>Scientific Service on the Internet: Solving Big Problems</article-title>
          ,”
          <year>2008</year>
          , pp.
          <fpage>149</fpage>
          -
          <lpage>155</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <article-title>Evaluation of the Efficiency of Distributed Systems in Solving Problems of Variable Size, Scientific and technical bulletin of St</article-title>
          . Petersburg State University ITMO, vol.
          <volume>2</volume>
          ,
          <issue>2010</issue>
          , pp.
          <fpage>66</fpage>
          -
          <lpage>71</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Posypkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Khritankov</surname>
          </string-name>
          ,
          <article-title>On the Concept of Performance in Distributed Computing Systems</article-title>
          ,
          <source>in ISA RAS</source>
          , vol.
          <volume>32</volume>
          ,
          <year>2008</year>
          , pp.
          <fpage>26</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>V.</given-names>
            <surname>Grechaninov</surname>
          </string-name>
          , et al.,
          <article-title>Decentralized Access Demarcation System Construction in Situational Center Network</article-title>
          ,
          <source>in Workshop on Cybersecurity Providing in Information and Telecommunication Systems II</source>
          , vol.
          <volume>3188</volume>
          , no.
          <issue>2</issue>
          ,
          <issue>2022</issue>
          , pp.
          <fpage>197</fpage>
          -
          <lpage>206</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Balcazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dıaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gabarro</surname>
          </string-name>
          ,
          <string-name>
            <surname>Structural Complexity</surname>
            <given-names>II</given-names>
          </string-name>
          , vol.
          <volume>22</volume>
          .
          <source>EATCS Monographs on Theoretical Computer Science</source>
          ,
          <year>1990</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -75357-2.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Balcazar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dıaz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Gabarro</surname>
          </string-name>
          ,
          <string-name>
            <surname>Structural Complexity</surname>
            <given-names>I</given-names>
          </string-name>
          , 2nd Ed.
          <source>Theoretical Computer Science, An EATCS Series</source>
          ,
          <year>1995</year>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -79235-9.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>O.</given-names>
            <surname>Goldreich</surname>
          </string-name>
          . P, NP, and
          <article-title>NP-Completeness: The Basics of Complexity Theory</article-title>
          . Cambridge University Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>K. J. Åström</surname>
          </string-name>
          , T. Hägglund, Advanced PID control, USA, Instrumentation, Systems, and Automation Society,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>A. O'Dwyer</surname>
          </string-name>
          ,
          <article-title>Handbook of PI and PID Controller Tuning Rules</article-title>
          , London, Imperial Colledge Press,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>