Effective Methods for Creation of Malfunction Search Algorithms in Information Systems

Abstract

The relevance of the studied problem is caused by the fact that optimum malfunctions search algorithms allow to reduce considerably losses at refusals of information systems. At the same time, on the way of creation of such algorithms quite often there are insuperable computing difficulties. They are connected with need of drawing up the table of malfunctions, for a concrete information system, and finding the optimum algorithm among a huge number of possible malfunctions search algorithms. The first of these problems substantially found the solutions because of emergence of the powerful software for technical systems modeling. The second still remains unsolved. The purpose of the paper is in increasing the efficiency of methods for creation of algorithms of malfunction search in information systems. In this paper solutions are proposed which simplify the process of creation for required algorithms, when the method of dynamic programming is applied. Optimization is performed by criterion of a minimum of the average time for search of malfunctions. The recurrence relation is offered, which does not demand recalculation of probabilities at consecutive finding of the minimum average time of malfunction search by the method of dynamic programming. Materials of the paper can be useful to specialists in service, control and diagnostics of information systems.