EUVIMEDEUVIMED entdecken
Crossref

Finding General Mathematical Formulas for Extraction the Minimal Path Sets of Complex Parallel-Series Networks

Mariem Hassan Lafta, Zahir Abdul Haddi Hassan

Iraqi Journal for Computer Science and Mathematics · 27.03.2025 · 6 (1)

DOI: 10.52866/2788-7421.1237 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Iraqi Journal for Computer Science and Mathematics, online erschienen am 27.03.2025. Verfasst von Mariem Hassan Lafta und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Most real-world technological systems are highly complex, making it challenging to examine their reliability. Many systems can be represented as Complex Parallel-Series Networks (CPSN). The large number of components and subnetworks, along with their intricate connection, complicates the identification, evaluation, and potential failure of the CPSN. A minimal path set is a minimal set of components whose proper functioning (success) guarantees the success (operability) of the system. The set is minimal in the sense that removing any component from it means it no longer guarantees system success. The primary research problem is to identify these minimal path sets, both for the overall CPSN and for its complex subnetworks. This paper presents a mathematical technique for analyzing subnetworks instead of the whole CPSN to reduce computational effort and simplifies intricate calculations. Specialized algorithms and techniques are presented and used to identify minimal path sets, with numerical results funded by general formulas. Numerical cases show the effectiveness and applicability of this technique for CPSN.

Zitieren

APA

Lafta, M. H., & Hassan, Z. A. H. (2025). Finding General Mathematical Formulas for Extraction the Minimal Path Sets of Complex Parallel-Series Networks. Iraqi Journal for Computer Science and Mathematics, 6(1). https://doi.org/10.52866/2788-7421.1237

Vancouver

Lafta MH, Hassan ZAH. Finding General Mathematical Formulas for Extraction the Minimal Path Sets of Complex Parallel-Series Networks. Iraqi Journal for Computer Science and Mathematics. 2025;6(1). doi:10.52866/2788-7421.1237

BibTeX
@article{Lafta2025,
  author = {Lafta, Mariem Hassan and Hassan, Zahir Abdul Haddi},
  title = {Finding General Mathematical Formulas for Extraction the Minimal Path Sets of Complex Parallel-Series Networks},
  journal = {Iraqi Journal for Computer Science and Mathematics},
  year = {2025},
  volume = {6},
  number = {1},
  doi = {10.52866/2788-7421.1237}
}
Kostenlos starten →