RUS  ENG
Full version
JOURNALS // Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya // Archive

Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2020 Volume 16, Issue 1, Pages 41–49 (Mi vspui437)

This article is cited in 2 papers

Computer science

Determining the ability to work of the system, the structure of which is given using graph

A. G. Karpov, V. A. Klemeshev, D. Yu. Kuranov

St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation

Abstract: A system of algorithms for the analysis of systems of different nature, the structure of which is given using graphs of great complexity, is proposed. The analysis consists in checking the connectivity and physical realizability of the system, the structure of which is given by the graph, as well as in checking the absence of non-working loops. The proposed algorithms can be used not only to develop new systems but also to diagnose operating equipment and troubleshooting. The approach to determining the physical realizability of a graph is that first a system of basis cycles is constructed. After that it is determined whether each branch is included in one of them. The operation of the system of algorithms is demonstrated by the example of an electrical system. However, the results obtained can be extended to systems of a different nature, for example, using electromechanical analogies.

Keywords: graph, graph connectivity, fundamental cycle.

UDC: 519.178, 519.174.2

MSC: 05C85

Received: November 1, 2019
Accepted: February 13, 2020

DOI: 10.21638/11701/spbu10.2020.104



© Steklov Math. Inst. of RAS, 2024