Petri net approach for determining the paths and terminal reliability of a hypercube network

An algorithm for calculating the paths through a hypercube based on the algorithm by L. Fratta and U. Montanari (1973), which relies on a Boolean expression representation of the simple paths in the network, is given. The advantages to this algorithm are the iterative nature (which could be parallelized in the future) and the Boolean approach for the path determination.<
>