Data flow diagrams (DFD), which originated from the popular Structured Analysis methodology [4, 5, 11] can be used to model a system in the form of a network of components and interfaces among them. When a system is too complex to be shown in a single diagram, it can be partitioned into subsystems, which can be further partitioned until each component can be described in a simple diagram made of primitive processes. Each of these successive partitions is documented in a separate DFD, so that we have a hierarchical structure. In order to ensure consistency, all data flows into/out of a child diagram must be represented on the parent diagram by the same data flows into/out of the corresponding bubble. We are also free to refine data flows into more detail on the child diagrams, so that we have a parallel decomposition of both data and processes. A labeling convention for bubbles and diagrams has been included to facilitate traceability between different levels of abstraction. Furthermore, these labels can be used for tracing the correspondence between the requirements specification and the final design.
[1]
Lih Pong,et al.
Formal data flow diagrams (FDFD): a petri-netbased requirements specification language
,
1985
.
[2]
Tom DeMarco,et al.
Structured Analysis and System Specification
,
1978
.
[3]
T. T. Soong,et al.
Book Reviews : System Dynamics: K. Ogata Prentice-Hall, Englewood Cliffs, New Jersey, 1978
,
1980
.
[4]
Victor Weinberg,et al.
Structured Analysis
,
1978
.
[5]
W. F. Dean.
Bittner, John R.,Mass Communication: An Introduction, Englewood Cliffs, New Jersey, Prentice-Hall, 1977
,
1978
.
[6]
Alan M. Davis,et al.
The Design of a Family of Application-Oriented Requirements Languages
,
1982,
Computer.