Graph-Based and Algebraic Models for Evaluating the Interoperability of an Information Systems

Modern information systems at the corporate and strategic level require portability, extensibility, scalability and interoperability, which allows them to be classified as open information systems (OIS). At the same time, there are no universal methods for quantifying interoperability. The paper shows that the functional compatibility of the OIS subsystems, which is based on components pairing set, can be described by an algebraic group and represented as bipartite graphs. Based on this representation, an algorithm for evaluating interoperability is proposed, using the quantitative assessment of the matching of such graph-models. To analyze the interactions between the components of an OIS and assess their degree of consistency and compatibility, it is proposed to use the Hopcroft-Karp algorithm to find the maximum match in a bipartite graph. To quantify the interoperability, it is proposed to use the ratio of the maximum matching of a bipartite graph to its perfect matching. The software implementation of the proposed algorithms has been performed and an experimental verification of their operation has been carried out.