An algorithm to code and decode complex systems, and to compute s-t reliability

In this paper, the more challenging calculation of an exact reliability of a complex system is further enabled through an ad hoc binary enumeration algorithm in a hybrid form assisted by the polish notation approach. Aside from calculating the s-t reliability of any complex system, it is shown that the polish-notation constructed from the graphical interface using postfixes to describe the topology of any complex network is useful for identifying a given topology. Furthermore, the output can then be transported, for reasons of security or saving storage space, to a remote analyst who in turn using this algorithm can reverse a given polish-notation in a decoding phase to reconstruct the topology. Both forward (encoding) and reverse (decoding) algorithms work for both simple series-parallel and non series-parallel, i.e., complex networks. Further, a proposed hybrid method also computes the exact s-t reliability for complex systems. Networks of various complexities are examined. The efforts to save time are in progress for large networks exceeding 20 nodes.