А.А. Gornitskiy - Post-graduate Student, Department of Algebra, Mechanical-Mathematical Faculty, Lomonosov Moscow State University. E-mail: gnomage@mail.ru B.А. Gornitskiy - Post-graduate Student, GSKB «Almaz-Antey» (Moscow). E-mail: borune@mail.ru M.N. Yokhin - Ph.D. (Eng.), NRNU «MEPHI» (Moscow). E-mail: mnyokhin@mephi.ru Yu.M. Mitin - Post-graduate Student, GSKB «Almaz-Antey» (Moscow). E-mail: muriy@mail.ru

Reliability is one of the most important parameters of control systems, built on industrial networks base. The vital task of control system synthesis is development of network structure, having the maximum probability for all required tasks execution with consideration of all constraints for entire system. As a rule, system executes several tasks, that-s why the increasing of execution-s probability for the multitude of tasks is reasonable. The heuristic algorithm for designing of network structure, adapted for multitude of tasks execution with consideration of their frequency is proposed in this article. This algorithm uses approximate algorithm for boolean variable polynom minimization, but in case when network has not many nodes the result can be found using the branch and bound algorithm.

 

1. Gornickijj B.A., Ekhin M.N., Mitin M.JU. Modeli setevojj nadezhnosti v zadache optimizacii struktury sistemy upravlenija mnogokoordinatnym peremeshheniem antennykh sekcijj. Moskva // Naukoemkietekhnologii. 2012. № 12. S. 8-13.
2. Ball M.O., Colbourn C.J., Provan J.S. Network reliability / Ed. by M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser. Handbooks in Operations Research and Management Science: Network Models. Amsterdam: ElsevierScience. 1995. V. 7. Ch. 11.P. 673-762.
3. Beresnev V.L., Goncharov E.N. Priblizhennyjj algoritm dlja zadachi minimizacii polinomov ot bulevykh peremennykh // Diskretnyjj analiz i issledovanie operacijj. Ser. 2. 1998. T. 5. № 2. S. 3-19.