Minimization of the automatic machine structure process of accounting and control of railway automation and telemechanics devices

. The article explores the features of electronic document management of technical documentation of railway automation and telemechanics. A block diagram of an automaton model of technical documentation is developed. The proposed block diagram of a formalized model of technical documentation consists of matrices of external microoperations, internal microoperations, code creation for the following microcomponents. The number of internal states of the firmware is completely determined by the number of logic elements of the algorithms. The size of the matrices depends on the number of operators and logical conditions in the logic circuits of the algorithms. In this paper, a non-maximal group of compatible elements of logic circuits of algorithms is used as a microcommand, which led to the simplification of the matrix of the circuit of the firmware automaton. In the considered method of forming the maximum groups of compatible elements of logic schemes of algorithms, micro operations included in each micro command are performed simultaneously in one microtact. The structure of the firmware of the machine is simplified due to the transition from simple to complex micro-ops.


Introduction
The traditional way to automate electronic document management of technical documentation (EDMTD) is that the development of software gradually changes to the background mode, since even minor changes in the transport scheme and technological process mean the need to reprogram the application and consume more amount of time and money. As a result, there will be no time to update appeals, based on changing conditions and requirements of railway transport [1][2][3]. Actively developing systems associated with enterprise automation require a large number of trained personnel due to the high complexity. In addition, the number of qualified specialists in the field of automation is growing insufficiently fast [6]. Thus, the task is to create an easy-to-use, reliable automation tool, in the arsenal of which there are not only tools for describing a business process, but also its implementation. The possibility of implementation is important, since a pure descriptive tool is interesting only from the point of view of the analysis of technological processes and can be used only as part of a technical task when performing a specific model of the work process [7,8]. EDMTD modeling is presented in the works of both Russian [9][10][11][12][13][14] and foreign authors [15][16][17][18][19][20].
Based on the logic schemes of algorithms (LSA) developed in the papers [20][21][22] for the process of accounting and control of railway automation and telemechanics devices (CARCD), this article presents a block diagram of an automatic model of technical documentation (TD), microcommands are formed according to the logic diagrams of algorithms TD, the problems of simplifying the structure of the automaton of the CARCD process are considered.
The purpose of this work is to describe and define an automated workflow model. EDMTD is considered as an object of modeling. To implement the model, an approved machine of the theory of automata will be used, adapted to modern programming technologies. The task of creating and implementing EDMTD is very urgent today. Significant financial, material and time resources are spent at enterprises and organizations of the railway to solve this problem.

Development of a block scheme of an automaton model of technical documentation
On the basis of a microprogram machine (MA), a block diagram of a formalized TD model has been developed.
Based on the MA, the Wilks-Stinger scheme was implemented, which is used when there are no strict requirements for the speed of machine control in the synthesis of microprograms with the least control [23]. The proposed structural diagram of the formalized TD model consists of matrices of external micro-operations M1, internal micro-operations M2, code creation for the following micro-components M3. The presented model has become a new system paradigm for the representation of TDs [4,5].
Each external micro-operation is a control operator, and the internal one is a control logical condition that checks a condition whose values are fulfilled ( = 1; marked with a + sign) or non-fulfilled condition ( = 0; marked with a -sign). On the structural diagram, a circle denotes a circuit that serves to query the value of the condition it is checking (Fig. 1).
Firmware, i.e. the sequence of microoperations is conveniently described in the language of LSA, and external microoperation is associated with the operator , and internal microoperation is associated with the logical condition . When performing this operation, each micro-command includes only one microoperation (external or internal) and includes only one operator or logical condition during each microtact. The number of internal states of MA is completely determined by the number of LSA elements. The size of the matrices M1 and M2 depends on the number of operators and logical conditions in the LSA. In the specific case, when only operators enter the LSA, the matrix M2 is absent. In this case, successive microcommands are generated each time in the M3 matrix.
If there are logical conditions in the LSA, the matrix M2 is needed, in which they are formed . If the value checked in the logical condition (if it enters the LSA without inversion), the order of execution of the LSA elements is violated. Then, in M3, the necessary number of micro-commands must be formed in order to correctly perform LSA.
If combine a separate micro-command with each element of the LSA, even a very simple algorithm requires that MA fulfill a large number of internal states. At the same time, there is no need to distinguish the internal position for each LSA element. Some external microoperations may not be performed sequentially, but simultaneously in a single microtact. This occurs when the operator performing operations on the corresponding microtacts can work in parallel. LSA statements executed simultaneously are not related to the internal state of a single MA statement. This minimizes the number of internal states of MA. The combination of individual microoperations over time leads to an increase in speed, since the number of microtacts required to execute the algorithm decreases.
Simplification of the MA scheme can be obtained by simultaneously performing external and internal microoperations. Then the number of microcommands of MA will be determined not by the number of LSA elements, but by the number of groups of simultaneously performed microoperations. Consider the LSA technological process of accounting and control of railway automation and telemechanics devices AT, which includes planning and repair of equipment, control of reception and storage, as well as the movement of devices in the repair and maintenance department: The CARCD process is presented in the LSA language [24,25]. The main elements are the operators , = 1, , = 1, that correspond to the elementary actions of the process, logical conditions , = 1, -the probability of their fulfillment depends on the current state of the process CARCD, represented by arrows ↑ , = 1, , where p is the index of the arrow. Here will be distinguish 6 groups of simultaneously performed microoperations: It follows from (1) that MA will have six internal states. The M3 matrix in Fig. 2 is constructed when compared with microcommands 1, 2, 3, 4, 5, 6 of the code combinations 001, 010, 011, 100, 101, 110, respectively.
Thus, will be examined the method of phasing the micro-commands in stages, and as a result will be switched from the micro-command, which includes only one external or internal micro-operation, to the micro-command, which includes the entire group of external and internal micro-operations. To form such microcommands, a firmware should be implemented in addition to the LSA, providing information on the possibility of simultaneous operation of various operators and the distribution of offsets for each operator. Obviously, the operator and the logical condition cannot be included in one micro-command if the value can be changed by the operator . The task of forming the smallest possible number of LSA microcommands is complex.
When considering various possible ways of constructing an MA circuit, it is considered that only one algorithm is implemented. However, a software control method is used precisely when several different algorithms need to be implemented in the machine.
The structure of the MA transition graph will largely depend on the choice of microcommands when comparing internal states with microcommands [26][27][28].
A special requirement is the development of methods that allow to minimize and encode the machine, taking into account various requirements.

Method for simplifying the structure of the automatic machine the process of accounting and control of railway automation and telemechanics devices
The subsequent simplification of the MA structure can be achieved by switching from simple to complex micro commands. In complex micro-commands, it is characteristic that the microoperations included in it may not be performed simultaneously, but sequentially over time, and the set of these micro-operations may change depending on the values of the conditions checked when performing internal micro-operations included in this micro-command.
When forming simple micro commands, will be assumed that each functional block (FB) has one input, the impact of which should be removed after this FB has finished its work (i.e., the corresponding micro operation is performed).
In the technological process of CRCAD, representing LSA A71 in practice, two algorithmic States * (completed) and * (not completed) can be used for one operator. The operators * and * are never executed simultaneously and can be called inverses.
The presence of inverse operators in the LSA that describe the operation of the firmware machine allows to build a machine with complex micro-commands.
In (2), a sequence of executing operators 1 1 , 2 2 , . . . , is required, and the FB corresponding to the operator can be enabled after the FB corresponding to the operator ( −1) has completed its work, i.e. when forming simple micro-commands, only one operator can be included in each of them, and the number of internal States of the MA will be equal to the number of operators. Can allow the operator to be executed simultaneously with the operators ( +1) , . . . , ( + ) ( ≤ ), if there is no operator * among the latter, and map not one, but several groups of operators that make up a complex microcomand to each internal state of the MA. But now operators , . . . , ( + ) that are part of the same micro-command must be executed sequentially, i.e. the value ( +1) cannot appear before the operator ( +1) ends. In order to ensure the specified sequence of function blocks, each time before executing an operator ( +1) , must check whether the operator is executed. Therefore, in addition to the usual logical conditions in the LSA, must enter special waiting logical conditions  that check the execution of the corresponding operators. Will be denote such logical conditions by , assuming that = 1, if the operator is executed and = 1, if the operator * is executed.
LSA (4.4) will have the form: Will be still assume that the values of all logical conditions included in the LSA are changed only by the operators of this LSA. After the algorithm is executed, the values of the conditions can change from the outside, while the conditions do not change. Another feature of logical conditions is the absence of ramifications in the LSA, the introduction of a time delay, fixing the moment when the corresponding operators are executed. Therefore, for ease of recording, such LU's can not be included in the LSA, although the corresponding logical blocks will be included in the machine.
Then write the LSA in the form: (4) Fig. 2 shows the structure of the MA with complex micro-commands based on the LSA (4). The automaton has twelve internal States. Therefore, the expansion of simple microcommands and the formation of complex micro-commands make it possible to simplify the structure of the MA.
The method of forming complex micro-commands is similar to forming simple microcommands, but now all operators can be included in one micro-command, except inverses. Therefore, when creating complex micro-commands, the definition of conflicting LSA elements will change somewhat.
Definition. Two elements of the LSA and are contradictory if: 1) they are inverse operators; 2) is a logical condition, a -an operator that can be executed after verification , and the logical condition is included in the shift distribution of the operator .  Thus, in contrast to a simple one, a complex microcomand can include a logical condition and an operator that changes the value of this logical condition ( − { }), if only the check must be performed after the operator is executed. Using the previously described method of forming micro-commands, taking into account this definition of inconsistency, will be made complex micro-commands for LSA (4): In (7), two complex micro-commands are reflected; the mA scheme, whose internal States are compared with these micro-commands, is shown in Fig.4.
Compatible groups of elements of this logic scheme of algorithms are mapped to the corresponding simple micro-commands in order to make the transition to complex microcommands and reduce the number of internal MA States.  For comparison, will be presented compatible groups of elements of this LSA corresponding to simple micro commands:  Thus, the transition to complex micro-commands complicates the M1 and M2 matrices, but simplifies and reduces the number of internal MA States.
Based on the results of the research presented in this paper, will be formulate the following conclusions: The proposed structural diagram of a formalized model of the technical documentation takes into account matrix external micro-operations, matrix of internal micro-operations, as well as matrix code generation the following macro. Simplification of the MA scheme is achieved by simultaneously performing external and internal micro-operations. The number of MA micro-commands is determined not by the number of LSA elements, but by the number of groups of simultaneously performed micro-operations.
A method for simplifying the MA scheme has been developed that allows simultaneous minimization and encoding of the machine, taking into account various requirements related to the document flow of automation and telemechanics farms. When comparing microcommands, maximum performance is achieved, i.e. the LSA is performed in the minimum number of clock cycles of the MA, and the MA itself has a minimum or close to it number of internal States.
The use of non-maximal groups of compatible LSA elements as micro-commands has led to simplification of mA scheme matrices. The use of a micro-command system simplifies the combination part of the MA.
With the considered method of forming maximum groups of compatible LSA elements, all micro operations included in each microcomand (which is typical for them) are performed simultaneously in one microtact.
Simplification of the MA structure was achieved by switching from simple to complex micro commands. A complex micro-command is characterized by the fact that the micro-