A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration

Martina Teruzzi; Nicola Demo; Gianluigi Rozza; Martina Teruzzi; Nicola Demo; Gianluigi Rozza

doi:10.3934/mine.2024002

Mathematics in Engineering

2024, Volume 6, Issue 1: 28-44. doi: 10.3934/mine.2024002

Previous Article Next Article

Research article

A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration

Mathematics Area, mathLab, SISSA, via Bonomea 265, I-34136 Trieste, Italy

Received: 01 November 2022 Revised: 03 November 2023 Accepted: 08 January 2024 Published: 11 January 2024

In this work we present a novel approach for modeling complex industrial plants, employing directed graphs to the simulation and automatic reconfiguration after failures. The framework offers the possibility to model the failure propagation, estimating the overall condition of the system before and after the damage and exploit such a health index for dynamic recalibration. To model the typical operation of industrial plants, we propose several additions with respect to the standard graphs: i) a quantitative measure to control the overall condition of the system ii) nodes of different categories–and then different behaviors–and iii) a fault propagation procedure based on the predecessors and the redundancy of the system. The obtained graph is able to mimic the behavior of the real target plant when one or more faults occur. Additionally, we also implement a generative approach capable of activating a particular category of nodes in order to contain the issue propagation, equipping the network with the capability of reconfiguring itself and resulting in a mathematical tool useful not only for simulating and monitoring but also to design and optimize complex plants. The final asset of the system is provided in the output with its complete diagnostics and a detailed description of the steps that have been carried out to obtain the final realization.
- risk-analysis,
- graph-theory,
- fault-diagnosis,
- automatic reconfiguration,
- industrial applications,
- signed-directed-graphs
Citation: Martina Teruzzi, Nicola Demo, Gianluigi Rozza. A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration[J]. Mathematics in Engineering, 2024, 6(1): 28-44. doi: 10.3934/mine.2024002

Related Papers:

Abstract

In this work we present a novel approach for modeling complex industrial plants, employing directed graphs to the simulation and automatic reconfiguration after failures. The framework offers the possibility to model the failure propagation, estimating the overall condition of the system before and after the damage and exploit such a health index for dynamic recalibration. To model the typical operation of industrial plants, we propose several additions with respect to the standard graphs: i) a quantitative measure to control the overall condition of the system ii) nodes of different categories–and then different behaviors–and iii) a fault propagation procedure based on the predecessors and the redundancy of the system. The obtained graph is able to mimic the behavior of the real target plant when one or more faults occur. Additionally, we also implement a generative approach capable of activating a particular category of nodes in order to contain the issue propagation, equipping the network with the capability of reconfiguring itself and resulting in a mathematical tool useful not only for simulating and monitoring but also to design and optimize complex plants. The final asset of the system is provided in the output with its complete diagnostics and a detailed description of the steps that have been carried out to obtain the final realization.

References

[1]	S. Chechik, M. Langberg, D. Peleg, L. Roditty, Fault tolerant spanners for general graphs, SIAM J. Comput., 39 (2010), 3403–3423. https://doi.org/10.1137/090758039 doi: 10.1137/090758039
[2]	W. Shi, D. B. West, Diagnosis of wiring networks: an optimal randomized algorithm for finding connected components of unknown graphs, SIAM J. Comput., 28 (1999), 1541–1551. https://doi.org/10.1137/S0097539795288118 doi: 10.1137/S0097539795288118
[3]	J. Kleinberg, M. Sandler, A. Slivkins, Network failure detection and graph connectivity, SIAM J. Comput., 38 (2008), 1330–1346. https://doi.org/10.1137/070697793 doi: 10.1137/070697793
[4]	C. Reinartz, D. Kirchhübel, O. Ravn, M. Lind, Generation of signed directed graphs using functional models, IFAC-PapersOnLine, 52 (2019), 37–42. https://doi.org/10.1016/j.ifacol.2019.09.115 doi: 10.1016/j.ifacol.2019.09.115
[5]	C. Palmer, P. W. H. Chung, Creating signed directed graph models for process plants, Ind. Eng. Chem. Res., 39 (2000), 2548–2558. https://doi.org/10.1021/ie990637v doi: 10.1021/ie990637v
[6]	M. R. Maurya, R. Rengaswamy, V. Venkatasubramanian, A signed directed graph and qualitative trend analysis-based framework for incipient fault diagnosis, Chem. Eng. Res. Des., 85 (2007), 1407–1422. https://doi.org/10.1016/S0263-8762(07)73181-7 doi: 10.1016/S0263-8762(07)73181-7
[7]	D. Peng, Z. Geng, Q. Zhu, A multilogic probabilistic signed directed graph fault diagnosis approach based on bayesian inference, Ind. Eng. Chem. Res., 53 (2014), 9792–9804. https://doi.org/10.1021/ie403608a doi: 10.1021/ie403608a
[8]	X. Ma, D. Li, A hybrid fault diagnosis method based on fuzzy signed directed graph and neighborhood rough set, 2017 6th Data Driven Control and Learning Systems (DDCLS), Chongqing, China, 2017,253–258. https://doi.org/10.1109/DDCLS.2017.8068078
[9]	mathLab, GRAPE: GRAph Parallel Environment. Available from: https://github.com/mathLab/GRAPE.
[10]	A. Maurizio, Representation of distribution networks of ships using graph-theory, MS. Thesis, SISSA (International School for advanced Studies), 2018.
[11]	M. Teruzzi, Parallel implementations for complex graph analysis with application in modern passenger ship safety management, MS. Thesis, SISSA (International School for advanced Studies), 2020.
[12]	L. Euler, Solutio problematis ad geometriam situs pertinentis, Comment. Acad. Sci. Petropolitanae, 1736,128–140.
[13]	J. J. Sylvester, Chemistry and algebra, Nature, 17 (1878), 284. https://doi.org/10.1038/017284a0
[14]	P. Erdős, A. Rényi, On random graphs I, Publ. Math., 6 (1959), 290–297.
[15]	A. Cayley, On the theory of the analytical forms called trees, Phil. Mag., 13 (1857), 172–176.
[16]	G. Kirchhoff, Ueber den durchgang eines elektrischen stromes durch eine ebene, insbesonere durch eine kreisförmige, Ann. Phys., 140 (1845), 487–514. https://doi.org/10.1002/andp.18451400402 doi: 10.1002/andp.18451400402
[17]	F. Dörfler, J. W. Simpson-Porco, F. Bullo, Electrical networks and algebraic graph theory: Models, properties, and applications, Proceedings of the IEEE, 106 (2018), 977–1005. https://doi.org/10.1109/JPROC.2018.2821924 doi: 10.1109/JPROC.2018.2821924
[18]	W. Huber, V. J. Carey, L. Long, S. Falcon, R. Gentleman, Graphs in molecular biology, BMC Bioinformatics, 8 (2007), S8. https://doi.org/10.1186/1471-2105-8-S6-S8
[19]	E. Otte, R. Rousseau, Social network analysis: a powerful strategy, also for the information sciences, J. Inform. Sci., 28 (2002), 441–453. https://doi.org/10.1177/016555150202800601 doi: 10.1177/016555150202800601
[20]	E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math., 1 (1959), 269–271. https://doi.org/10.1007/BF01386390 doi: 10.1007/BF01386390
[21]	R. Floyd, Algorithm 97: shortest path, Communications of the ACM, 5 (1962), 345. https://doi.org/10.1145/367766.368168
[22]	B. Roy, Transitivité et connexité, C.-R. Acad. Sci. Paris, 249 (1959), 216–218.
[23]	S. Warshall, A theorem on boolean matrices, J. ACM, 9 (1962), 11–12. https://doi.org/10.1145/321105.321107 doi: 10.1145/321105.321107
[24]	J. H. Holland, Genetic algorithms and the optimal allocation of trials, SIAM J. Comput., 2 (1973), 88–105. https://doi.org/10.1137/0202009 doi: 10.1137/0202009
[25]	J. H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, MIT Press, 1992.
[26]	M. Kumar, M. Husain, N. Upreti, D. Gupta, Genetic algorithm: review and application, Int. J. Inf. Tech. Knowl. Manage., 2 (2010), 451–454.
[27]	T. A. El-Mihoub, A. A. Hopgood, L. Nolle, A. Battersby, Hybrid genetic algorithms: a review, Eng. Lett., 13 (2006), 124–137.
[28]	R. Sivaraj, T. Ravichandran, A review of selection methods in genetic algorithm, Int. J. Eng. Sci. Tech., 3 (2011), 3792–3797.
[29]	S. M. Elsayed, R. A. Sarker, D. L. Essam, A new genetic algorithm for solving optimization problems, Eng. Appl. Artif. Intel., 27 (2014), 57–69. https://doi.org/10.1016/j.engappai.2013.09.013 doi: 10.1016/j.engappai.2013.09.013
[30]	Z. Drezner, A new genetic algorithm for the quadratic assignment problem, INFORMS J. Comput., 15 (2003), 320–330. https://doi.org/10.1287/ijoc.15.3.320.16076 doi: 10.1287/ijoc.15.3.320.16076
[31]	F. A. Fortin, F. M. De Rainville, M. A. Gardner, M. Parizeau, C. Gagné, DEAP: evolutionary algorithms made easy, J. Mach. Learn. Res., 13 (2012), 2171–2175.
[32]	V. Batagelj, U. Brandes, Efficient generation of large random networks, Phys. Rev. E, 71 (2005), 036113. https://doi.org/10.1103/PhysRevE.71.036113 doi: 10.1103/PhysRevE.71.036113

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)