# An Algorithm for computing the t-signature of two-state networks

## TL;DR

This paper introduces an algorithm to compute the t-signature, a probability vector representing network reliability when multiple components may fail simultaneously, extending traditional signature concepts.

## Contribution

The paper presents a novel algorithm for calculating the t-signature of two-state networks, accounting for multiple simultaneous component failures.

## Key findings

- Algorithm effectively computes t-signature for various networks.
- Performance evaluation demonstrates efficiency and accuracy.
- The method enhances reliability analysis by considering multiple failures.

## Abstract

Due to the importance of signature vector in studying the reliability of networks, some methods have been proposed by researchers to obtain the signature. The notion of signature is used when at most one link may fail at each time instant. It is more realistic to consider the case where non of the components, one component or more than one component of the network may be destroyed at each time. Motivated by this, the concept of t-signature has been recently defined to get the reliability of such a network. The t-signature is a probability vector and depends only on the network structure. In this paper, we propose an algorithm to compute the t-signature. The performance of the proposed algorithm is evaluated for some networks.