Design of an approximating model of a path which characterizes the functioning of a computing system

Design of an approximating model of a path is formulated as a problem of finding an accurate decomposition of a structural sequence in a specified vocabulary of reference fragments. A dynamic programming algorithm for its solution is described.