1Computer EngineeringDepartment, Shabestar Branch, Islamic Azad University, Shabestar, Iran
2United Institute of Engineering Cybernetics, National Academy of Sciences of Belarus,Minsk, Belarus
The problem of series two-block disjoint decomposition of completely specified Boolean functions is considered. Analysis and investigation of such systems are very important in logical design context. Recently, a good method for solving this problem was suggested which has been based on the ternary matrix cover approach. Using this method a computer program was developed. This paper is focused on decomposability of a system of Boolean functions. The experiments were done on generated systems and standard benchmarks. In decomposable systems, the total number of solutions and the time elapsed to achieve them are inspected. The total number of solutions among all partitions for investigated systems, ranged between 3% and 87% in generated systems and also, 1% and 96% in standard benchmarks.