Subscribe

Issue No.02 - February (1988 vol.14)

pp: 169-183

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.4636

ABSTRACT

<p>Data flow diagram process decomposition, as applied in the analysis phase of software engineering, is a top-down method that takes a process, and its input and output data flows, and logically implements the process as a network of smaller processes. The decomposition is generally performed in an ad hoc manner by an analyst applying heuristics, expertise, and knowledge to the problem. An algebra that formalizes process decomposition is presented using the De Marco representation scheme. In this algebra, the analyst relates the disjoint input and output sets of a single process by specifying the elements of an input/output connectivity matrix. A directed acyclic graph is constructed from the matrix and is the decomposition of the process. The graph basis, grammar matrix, and graph interpretations, and the operators of the algebra are discussed. A decomposition procedure for applying the algebra, prototype, and production tools and outlook are also discussed.</p>

INDEX TERMS

data flow diagram process decomposition; software engineering; top-down method; De Marco representation scheme; input/output connectivity matrix; directed acyclic graph; grammar; directed graphs; program verification; programming theory; software engineering

CITATION

M. Adler, "An Algebra for Data Flow Diagram Process Decomposition",

*IEEE Transactions on Software Engineering*, vol.14, no. 2, pp. 169-183, February 1988, doi:10.1109/32.4636