The mathematical statement for the solving of the problem of N-version software system design

International Scientific and Research Conference on Topical Issues in Aeronautics and Astronautics (dedicated to the 55th anniversary from the foundation of SibSAU)

航空航天工程

Kovalev, I.V.^1 ; Kovalev, D.I.^1 ; Zelenkov, P.V.^1 ; Voroshilova, A.A.^1

Siberian State Aerospace University Named after Academician M.F. Reshetnev, 31 KrasnoyarskiyRabochiy prospect, Krasnoyarsk

660037, Russia^1

关键词: Complex optimization problems;    Deterministic optimization method;    Fault-tolerant software;    Mathematical statement;    N version programming;    Optimal structures;    Pseudo-Boolean optimization;    Software system designs;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/94/1/012012/pdf
DOI  :  10.1088/1757-899X/94/1/012012

学科分类：航空航天科学

来源: IOP

【 摘 要 】

The N-version programming, as a methodology of the fault-tolerant software systems design, allows successful solving of the mentioned tasks. The use of N-version programming approach turns out to be effective, since the system is constructed out of several parallel executed versions of some software module. Those versions are written to meet the same specification but by different programmers. The problem of developing an optimal structure of N-version software system presents a kind of very complex optimization problem. This causes the use of deterministic optimization methods inappropriate for solving the stated problem. In this view, exploiting heuristic strategies looks more rational. In the field of pseudo-Boolean optimization theory, the so called method of varied probabilities (MVP) has been developed to solve problems with a large dimensionality.