Evaluation of lattice theoretic techniques for task decomposition formalism

The authors have applied lattice-theoretic techniques of the task-decomposition process and have demonstrated the feasibility of such an approach. The technique incorporates the following steps. The complete state space for the task under consideration is defined. A state-machine model of the task is developed with primitive operations as inputs to the machine. The state machine serves as a tool to find the lattice of substitution property partitions from which the type of the decomposition (serial, parallel, or complex) is determined