In this paper, we consider evolutionary design of logical networks from the Computer Aided Design (CAD) point of view. We state that scanning of a space of all possible network solutions by a scanning window is the crucial point of an evolutionary paradigm. This is the base for implementation of CAD methods in order to improve the recently obtained results on evolutionary approach for a network synthesis. Firstly, we introduce the concept of a target design style in evolutionary network synthesis and show that it is closely relate d to the CAD problem of multi-level networks design over a fixed library of cells. Secondly, because the network search space is partitionable, we use the technique of decomposition of switching functions. Therefore, independent parallel processing of subspaces via genetic algorithms (GAs) is possible. Moreover, since GA is inherently parallel, we achieve massive parallel processing. The experimental data demonstrate the efficiency of the proposed approach and large improvements over recently obtained results.