On using partial substitutions for time decomposition of boolean functions into generalized graph flowcharts of algorithms

The notion of partial substitutions is introduced and the possibility of their application to analytical decomposition of Boolean functions, BF, is discussed for any specified exogenous decomposition function. The effect of that function on analytical BF decomposition with partial substitution is studied. The application of analytical BF decomposition with partial substitutions to different versions of time decomposition of these functions into generalized graph flowcharts of algorithms is described and some ways of micriprocessor implementation are discussed.