Geodesic
Formalization, estimation of algorithmic complexity and a method for solving the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 3 (2017), pp. 73-91

Voir la notice de l'article provenant de la source Math-Net.Ru

The article deals with the formulation of the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems. Importance of the task is caused by the fact that many automated systems for information processing and management have been in operation for decades after creation, while requirements for these systems change. Therefore, one should periodically bring information-management systems in accordance with new requirements. The analysis of the algorithmic complexity of the solution of the problem shows the impossibility of solving it by considering all possible variants because of the exponential dependence of the number of solutions on the size of initial data. In this regard, a heuristic algorithm based on "greedy" optimization technique was developed, which allows to significantly reduce complexity and obtain a rational solution of the problem in relatively small computational time.
Keywords: information processing and control system, design of automated control systems, life cycle of control systems, automation system. 
@article{VTPMK_2017_3_a5,
     author = {V. L. Lyaskovskii and I. B. Bresler and M. A. Alasheev},
     title = {Formalization, estimation of algorithmic complexity and a method for solving the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems},
     journal = {Vestnik Tverskogo gosudarstvennogo universiteta. Seri\^a Prikladna\^a matematika},
     pages = {73--91},
     publisher = {mathdoc},
     number = {3},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VTPMK_2017_3_a5/}
}
TY  - JOUR
AU  - V. L. Lyaskovskii
AU  - I. B. Bresler
AU  - M. A. Alasheev
TI  - Formalization, estimation of algorithmic complexity and a method for solving the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems
JO  - Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
PY  - 2017
SP  - 73
EP  - 91
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VTPMK_2017_3_a5/
LA  - ru
ID  - VTPMK_2017_3_a5
ER  - 
%0 Journal Article
%A V. L. Lyaskovskii
%A I. B. Bresler
%A M. A. Alasheev
%T Formalization, estimation of algorithmic complexity and a method for solving the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems
%J Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika
%D 2017
%P 73-91
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VTPMK_2017_3_a5/
%G ru
%F VTPMK_2017_3_a5
V. L. Lyaskovskii; I. B. Bresler; M. A. Alasheev. Formalization, estimation of algorithmic complexity and a method for solving the problem of choosing system-technical solutions for the creation (development) of distributed information-control systems. Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 3 (2017), pp. 73-91. http://geodesic.mathdoc.fr/item/VTPMK_2017_3_a5/