The algorithmization of the deterministic models technological cycles of automated control systems

The article discusses the problems of optimization control systems, via the methodologies of system and network analysis. It is shown, that the existing method for analysis and correction for deterministic model technological cycles automated control systems are aimed at obtaining optimal component values of the vector time-based with the vector by implementation, also for determine the duration of the whole technological cycle control. As description of technological cycle control does not depend on the type of control complex attaching initial value of the vector time-based for the graph of technological cycle control. Each component of the vector time-based ti corresponds to a time attracting computing system component structure for solution of the problem located in the i-th vertex of the graph. Time-based vector completely determines the information interaction between the structural components of the network. Vector by implementation is also used, where hj is the time of the information processing tasks and control of technological cycle control, located at the beginning of the j-th arc, and given the structure of the computer system. In the analysis of the feasibility of technological cycle control is necessary to establish the feasibility of vector time-based on a computer system with a given structure for a given vector h. To implement the technological cycle control to a given computer system structure with a given time-based vector it is necessary and sufficient that the following conditions: if the i-th from the graph of technological cycle control outgoing the j-arc, incoming to v-th vertex, then the difference tv - ti should not be less than the time of the task in the i-th vertex. This correction algorithm makes sense, when the non-negativity conditions, termination condition, the logical sequence of conditions. For the criterion estimation of the results optimization - minimization the time control by the shortening of the blank timing windows, Dijkstra’s algorithm was offered and implemented. That algorithm adapted for the graph of technological cycle control in part the terminological interpretation - introduced the new term temporal path characterizing duration of the routes control on the parts of information map.