Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2020, Volume 16, Issue 1, Pages 41–49
DOI: https://doi.org/10.21638/11701/spbu10.2020.104
(Mi vspui437)
 

This article is cited in 2 scientific papers (total 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
Full-text PDF (537 kB) Citations (2)
References:
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.
Received: November 1, 2019
Accepted: February 13, 2020
Document Type: Article
UDC: 519.178, 519.174.2
MSC: 05C85
Language: Russian
Citation: A. G. Karpov, V. A. Klemeshev, D. Yu. Kuranov, “Determining the ability to work of the system, the structure of which is given using graph”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 16:1 (2020), 41–49
Citation in format AMSBIB
\Bibitem{KarKleKur20}
\by A.~G.~Karpov, V.~A.~Klemeshev, D.~Yu.~Kuranov
\paper Determining the ability to work of the system, the structure of which is given using graph
\jour Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.
\yr 2020
\vol 16
\issue 1
\pages 41--49
\mathnet{http://mi.mathnet.ru/vspui437}
\crossref{https://doi.org/10.21638/11701/spbu10.2020.104}
Linking options:
  • https://www.mathnet.ru/eng/vspui437
  • https://www.mathnet.ru/eng/vspui/v16/i1/p41
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Вестник Санкт-Петербургского университета. Серия 10. Прикладная математика. Информатика. Процессы управления
    Statistics & downloads:
    Abstract page:61
    Full-text PDF :7
    References:8
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024