Disadvantages of Using the Heuristic Function of Proximity of the Execution Path to the Reference

Heuristic functions are widely used in modern technologies and are used to optimize various processes. We proposed a heuristic function to evaluate the closeness of an execution path to a reference path in the context of data storage systems. The function allows finding reference paths in graphs representing the software operation process. However, in some cases, this function exhibits shortcomings, such as ignoring the order of execution of critical operations and incorrect processing of cyclic structures. Recommendations are given for improving the function to increase its accuracy in evaluating the tested paths.