Computational ordering of adaptive digital networks

A computational ordering of an adaptive digital network is proposed. The method is based on the partitioning of a given network into blocks according to conditional branching. In order to find the effective ordering in each block, the precedence relationship between nodes in that block is used. The precedence of each conditional branching must be found to give the overall ordering of the network. A restriction in writing high-level language for adaptive networks is also given.<<ETX>>