Information Technology Reference
In-Depth Information
(a)
(b)
Fig. 2.8
Schema of the relationships between the algorithms; the case when the algorithm
Al
g
1
is not autonomous towards the algorithm
Al
g
2
with
interaction
relationship,
a
the sources of data
indispensable to calculate the transition function
f
1
,
b
the influence of the transition function
f
1
on
the change of the state of algorithms
f
1
influences both—the change of the state of the algorithm
Al
g
1
as well as the
change of the state of the algorithm
Al
g
2
. The schema of that relationship is shown
in Fig.
2.8
.
•
The algorithm
Al
g
1
is not autonomous toward the algorithm
Al
g
2
, with
interoperating
relationship (or completely non-autonomous) if for the transition
function
f
1
of the algorithm
Al
g
1
the following relationships occur:
x
2
x
2
))
∃
(
x
1
,
x
2
)
∈
Df
1
,(
x
1
,
x
2
)
∈
Df
1
(
x
2
=
⇒
f
1
(
x
1
,
x
2
)
=
f
1
(
x
1
,
(2.22)
and
∃
(
x
1
,
x
2
)
∈
Df
1
:
(
Proj
2
ⓦ
f
1
)(
x
1
,
x
2
)
=
x
2
,
(2.23)
which can be briefly (informally) denoted by
f
1
:
X
1
×
X
2
ₒ
X
1
×
X
2
.
(2.24)
It means that for the calculation of the transition function
f
1
, both states are
necessary—the state of the algorithm
Al
g
1
as well as the state of the algorithm
Al
g
2
—however, the calculation of the transition function
f
1
influences both, the
change of the state of the algorithm
Al
g
1
as well as the change of the state
of the algorithm
Al
g
2
. The interoperating relationship exists if both—the inter-
information relationship as well as the interaction relationship—take place at the
same time.
The algorithm
Al
g
1
is not autonomous towards the algorithm
Al
g
2
if there is an
inter-information, interaction or interoperating relationship.
The algorithms
Al
g
1
and
Al
g
2
are mutually autonomous if the algorithm
Al
g
1
is autonomous towards the algorithm
Al
g
2
and the algorithm
Al
g
2
is autonomous
towards the algorithm
Al
g
1
.
