An Algorithm for Calculating Multi-State Network Reliability Using Minimal Path Vectors

Mihova, Marija and Synagina, N. (2008) An Algorithm for Calculating Multi-State Network Reliability Using Minimal Path Vectors. In: Proceedings of the Sixth Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 12-16. ISBN 978-9989-668-78-4


Download (321kB) | Preview
Official URL:


We describe methodologies for the reliability analysis of multi-state systems. Especially, we are concentrating on the concept of a minimal path and a cut vectors. The problem of interest is known as the multi-state two-terminal reliability computation, and we regard how the concept of the minimal path and cut vectors is used for modelling the reliability of these types of systems. The main focus of this presentation is to develop an algorithm for obtaining minimal path vectors for multi-state two-terminal network with integer capacity of any link. The proposed algorithm used minimal path vectors for a binary system with the same structure as the regarded one. It is based on addition of vectors, so it is simply for understanding and fast. Examples are included to illustrate the Algorithm.

Item Type: Book Section
Uncontrolled Keywords: Reliability, multi-state systems, network reliability, minimal path vectors
Subjects: International Conference on Informatics and Information Technologies > Applied Mathematics
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15

Actions (login required)

View Item View Item