NOTICE OF CORRIGENDUM FOR: Lafta, Mariem Hassan and Hassan, Zahir Abdul Haddi (2025) ``Finding General Mathematical Formulas for Extraction the Minimal Path Sets of Complex Parallel-Series Networks,'' Iraqi Journal for Computer Science and Mathematics: Vol. 6: Iss. 1, Article 11. DOI: https://doi.org/10.52866/2788-7421.1237. Available at: https://ijcsm.researchcommons.org/ijcsm/vol6/iss1/11. Reason for Corrigendum: In the published article, the definition of minimal path set is stated incorrectly. The text defines a minimal path set as ``a set of components whose failure leads to failure of the whole CPSN,'' which corresponds to a minimal cut set, not a minimal path set. Correction: A minimal path set is a minimal set of components whose proper functioning (success) guarantees system success. A set is ``minimal'' if removing any component from it means it no longer guarantees system success. This corrigendum corrects the definition only; no other results, tables, or figures are changed.
Iraqi Journal for Computer Science and Mathematics (Sat,) studied this question.