Ways of representation of the algorithm the controlling automaton follows, страница 2

5.  One of conditional vertex’s outputs may be connected with its input. In this case, the conditional vertex is called the recurrent vertex (Fig.26.3);

6.  A conditional vertex is assigned with an element of the logic conditions set X, different conditional vertices may be assigned with the same element;

7.  An operational vertex is assigned with an operator (a microcommand) Y_t={y_t1,…,y_t2}, y_tuÎY, u=1,…,u_t – a subset of the microoperations set Y. Different operational vertices may be assigned with the same element. If u_t=0, the set Y_t is empty. In this case, an operational vertex is assigned with empty operator (the idling operator).

Executing of the GSA is started with the initial vertex Y₀ always and it has to be finished in the finishing vertex Y_k. A particular path through algorithm’s vertices is determined by the values of the logic conditions.

For example, if x₁=0, x₂=1,  the operators Y₁, Y₃, Y₄, Y_k will be executed one after another.

If x₁=0, x₂=0, x₃=0, the sequence of execution is Y₀, Y₂, Y_4, Y_k.

If x₁=0, after the operator Y₀, the operator Y₁ will be executed until the signal x₁ will change its value.

Aided with recurrent vertices, the waiting mode may be simulated.

It should be noted, a device performing the operator Y₁ starts to perform the next operator Y₃ if the conditions x₁=1, x₂=1, x₃=1 (the conjunction ) hold true. The operator Y₄ will be performed if the conditions x₁=1, x₂=1, x₃=0 (the conjunction ) hold true. So, each path in the GSA is corresponded with a conjunction of conditions.

26.2 The matrix scheme of an algorithm

            Consider a GSA with the initial vertex Y₀, the finishing vertex Y_k and T operational vertices T={ Y₁, Y₂, …, Y_T }.