Use of probabilistic splitting distributions of the original data during the sequential synthesis problem-solving algorithm

It is shown that the process of structuring of the solutions' set to the acceptable starts at the stage of the initial set building. At the same time, for a consistent structuring of the diversity of the solutions' set during the synthesis of problem-solving algorithms, it is advisable to use the principle of progressive reduction for the initial information uncertainty. At the first stage, the principle of gradual reduction of the uncertainty source for many alternative solutions is structured to multiple valid solutions while at the second stage, the set of feasible solutions is restructured to the set of efficient solutions; finally, the third phase selects a unique solution from the set of efficient solutions. The paper discusses the possibility to use fission probability distributions of the source data for the Committee (serial) synthesis algorithm solving the problem. A procedure is proposed for finding the optimal model evaluation of the corrective algorithm for composition with the basic (standard) algorithm for the purpose of mutual compensation of their errors. A number of examples illustrate the use of the formulated approach. The article presents the achieved results in improving the efficiency and the quality of the algebraizable way to solve the tasks of processing, analysis and control which is an actual and promising direction of modern information systems designing.