Representation of algorithms of system of management of complex objects in matrico-predicate type

The article indicates that the construction of control systems for objects that carry out the process begins, as a rule, with the compilation of algorithms for their functioning. This process is often carried out by heuristic methods, complex algorithms are compiled in separate blocks, and then “stitched” into a single whole. Basically, the construction is carried out in the form of graph diagrams, is difficult to read and inconvenient to process. The quality of these algorithms depends entirely on the qualifications of the engineering staff, on the knowledge of the process technology, on knowledge of the theory and practice of solving the problem. This paper shows the possibility of constructing algorithms in matrix form, that is, allowing one to obtain a formalized description in a more convenient and compact form and giving a way to solve many non-standard situations in the process of algorithmization. The article considers the possibility of carrying out a number of operations on graph diagrams, which are hereinafter referred to as “operations of additional definition”, which allowed us to write the algorithm in the form of a dual graph and allow us to represent it in the form of modular blocks, as well as to consider the possibility of representing the algorithms in matrix-predicate and tabular predicate form. It is concluded that defining the algorithms of control systems for complex processes in a mathematicalpredicate or tabular-predicate form makes it possible to use well-studied methods of graph theory, matrix theory, methods of predicate theory. In addition, it becomes possible to use set-theoretic and algebraic operations developed for graphs when working with algorithms.

1. Dubov V.M., Kapustyanskaya T.I. i dr. The problems of complex systems (conceptual foundations of model representations). SPb .: Elmore. 2006.

2. Kron G. Diakoptics; piecewise solution of large-scale systems. N.Y.: General Electric Co.1957.

3. . Lisicin A.L., Zotov I.V. Features of automation of management of complex systems using logical control systems. News of Southwestern State University. Series: Management, Computing, Informatics. Medical instrumentation. 2016;2(19):35-38.

4. Gabriel Kron Tensor analysis of networks. London: MacDonald. 1965.

5. Oreshkin S.A., Spesivcev A.V., Dajmand I.N. i dr. Synthesis of intelligent automated control systems for complex TP. Automation in industry. 2013;7:3-9.

6. Kononyuk A. E. Discrete-continuous mathematics. (Beginnings). K .: Education of Ukraine. 2014.

7. John E Hopcroft; Rajeev Motwani; Jeffrey D Ullman. Introduction to automata theory, languages, and computation. London: Addison-Wesley. 2001:537.

8. Guc A. K. Mathematical logic and theory of algorithms. M .: Librocom. 2009.

9. Zinkina N. S. Methods and models of logical control of discrete processes in distributed computing systems based on the concept of coordination. News of higher educational institutions. Volga region. Technical science. 2011;1(17):35-47.

10. Polyakov V.S., Polyakov S. V. Recording an algorithm with an incident matrix. Innovation based on information and communication technologies. Info 2014: Mater. XI international scientific-practical. Conf. (Sochi, October 1–10, 2014). 2014:149-152.

11. Polyakov V.S., Polyakov S. V. Presentation of a formal description of the functioning of the mechanisms of a shipping lock in a matrix-predicate form. Young scientist. 2017;17:69- 75.

12. Polyakov V.S., Polyakov S. V. Representation of the algorithm in a matrix-predicate form. European Research. 2016;2(13):29-35.

13. Berge C. The theory of graphs and its applications. N.Y.:John Wiley.1962:320.

14. Richard Bellman. Introduction to Matrix Analysis. New York: McGraw-Hili Book Company. 1970.

15. Smirnov A. V. Network model for the integer balancing problem of a four-dimensional matrix. Modeling and analysis of information systems. 2016;23(4)466-478.