The systems of sequences and the transition formulas

28 THE SYSTEMS OF SEQUENCES AND THE TRANSITION FORMULAS

28.1 The system of sequences

            The common situation, an operator Y_t of the complicated algorithm (describing, for example, the functioning of the automated management system) depends on finite subset of logic conditions {x_i1,…,x_ir} out of the total logic conditions set X.

            In this connection, it is convenient to use the specialized language for algorithms determining.

            An elementary sequence determines the condition to execute the following operator Y_j after the operator Y_i. A sequence is represented in a form (28.1):

                                                      (28.1)

            The symbol means “if then”. The formula (28.1) is to be read in such the way: the operator Y_j will be executed after the operator Y_i if  the condition  holds true.

            If the operator Y_j has many operators- predecessors, the sequence is represented in the generalized form the system of sequences:

, j=1,…,T.                                  (28.2)

            An example of algorithm representation in a form of the system of sequences:

                                   (28.3)

            It is easy to obtain the MSA right out of the system of sequences (the table 28.1).

            The sequence representation of an algorithm has advantage of compactness. Further, having obtained the MSA, the system of transition formulas may be written down.

Table 28.1