A1021
Title: On the computation of system signature
Authors: Ping Shing Ben Chan - The Chinese University of Hong Kong (Hong Kong) [presenting]
Abstract: The computation of the signature of a complex system is often challenging, as it may involve a large number of components and a complex architecture. We will discuss two different algorithms to compute the signature of a system. The first algorithm is proposed to compute the signature of a system with exchangeable components. This new algorithm relies on the information of minimal cut sets or minimal path sets, which is very intuitive and efficient. The next algorithm is used for computing the signature of a system consisting of subsystems with shared components. It relies on a new concept called decomposed survival signature. Applications in cyber systems and transportation systems are highlighted.
