• DocumentCode
    3259136
  • Title

    Decomposition of data flow diagrams

  • Author

    Arndt, Timothy ; Guercio, Angela

  • Author_Institution
    Dept. of Comput. Sci., Lamar Univ., Beaumont, TX, USA
  • fYear
    1992
  • fDate
    15-20 Jun 1992
  • Firstpage
    560
  • Lastpage
    566
  • Abstract
    Data flow diagrams are an important design aid in system development. CASE tools allow data flow diagram construction and modification to be automated. Decomposition is the top-down development of a data flow diagram starting with the system inputs and the system outputs. Decomposition may also be automated, resulting in an interactive process for data flow diagram design. Adler (1988) described an algebra for the decomposition of data flow diagrams. A set of quality measures was also described. The authors show that these quality measures do not correspond to the intuitive notion of a good decomposition. A new set of criteria is proposed which does correspond to the intuitive notion of a good decomposition. The use Adler´s algebra leads to an inefficient decomposition process, as well as one which is not guaranteed to find a good decomposition. The authors give an efficient algorithm which gives a good decomposition
  • Keywords
    interactive systems; software tools; systems analysis; CASE tools; data flow diagram decomposition; design aid; interactive process; quality measures; system development; top-down development; Algebra; Automation; Computer aided software engineering; Computer science; Design for disassembly; Flow graphs; Matrix decomposition; Performance analysis; Process design; Software engineering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering and Knowledge Engineering, 1992. Proceedings., Fourth International Conference on
  • Conference_Location
    Capri
  • Print_ISBN
    0-8186-2830-8
  • Type

    conf

  • DOI
    10.1109/SEKE.1992.227904
  • Filename
    227904