Computational Properties of Boolean Networks
Sergey A. Shumsky
Lebedev Physics Institute,
Leninsky pr.53, Moscow, Russia
Abstract
This paper considers computational characteristics of boolean automata networks with random interconnections. The subjects of interest are: the number of stationary points, the convergence of the dynamic flow to these points, compactness of the attraction basins, number of logical switchings during the run, and informational content of the phase portrait. For a special class of uniform diluted nets, these quantities are found to depend basically on two integrated characteristics of network elements.
