Professional Documents
Culture Documents
Systems
Process Modeling
Dr Amr Eltawil
Data Flow Diagrams
DFD
Learning Objectives
9 Understand
U d t d th the llogical
i l modeling
d li off processes
through studying data flow diagrams
9 H
How tto d
draw d data
t flflow di
diagrams usingi rulesl and
d
guidelines
9 H
How tto d
decompose d data
t flflow di
diagrams iinto
t
lower-level diagrams
9 B l
Balancing
i off data
d t fl flow di
diagrams
9 Discuss the use of data flow diagrams as
analysis
l i ttools
l
9 Represent processing logic using Structured
E li h and
English dd decision
i i ttables
bl
5.2
2
Process Modeling
Graphically represent the processes that
capture, manipulate, store and distribute data
between a system and its environment and
among system components
Data flow diagrams (DFD)
Graphically
p y illustrate movement of data between
external entities and the processes and data stores
within a system
5.3
3
A DFD example
4
DFD Symbols
Data Flow
Depicts
p data that are in
motion and moving as a unit
from one p
place to another in
the system
Drawn as an arrow
Select a meaningful name to
represent the data
5.5
5
DFD Symbols
Process
Depicts
p work or action
performed on data so that
they
y are transformed,, stored
or distributed
Drawn as a rectangle with
rounded corners
Number of process as well as
name are recorded
5.6
6
Data Flow Diagramming Symbols
Data
D t Store
St
Depicts data at rest
May represent data in:
Filefolder
Computer-based file
Notebook
5.8
8
A DFD example
5.9
9
5.10
10
The system consists of many subsystems
11
Decomposition of DFDs
Functional decomposition
Act of g
goingg from one
single system to
many y component
p p
processes
Repetitive procedure
Lowest level is called a primitive DFD
When decomposing a DFD, you must
conserve inputs
i t to
t andd outputs
t t from
f a
process at the next level of decomposition
5.12
12
Decomposition of DFDs
Level-N Diagrams
A DFD that is the result
of n nested decompositions
of a series of sub-processes from a process on a level-0
diagram
Rules for stopping decomposition
When each process has been reduced to a single
decision, calculation or database operation
When each data store represents data about a single
entity
When the system user does not care to see any more
5.13
detail
13
16
Data Flow Diagramming Rules
Process Data Store
A. No process can have only D. Data cannot be moved
outputs (a miracle) from one store to another
B. No process can have only E. Data cannot move from an
inputs (black hole) outside source to a data
C. A process has a verb store
phrase label F. Data cannot move directly
from a data store to a data
sink
G. Data store has a noun
phrase
h llabel
b l
5.17
17
5.18
18
Data Flow Diagramming Rules
Data Flow (Continued)
L. A join means that exactly the same data come from
any two or more different processes, data stores or
sources/sinks to a common location
M A data
M. d t flow
fl cannott go directly
di tl b back
k tto th
the same
process it leaves
N A data flow to a data store means update
N.
O. A data flow from a data store means retrieve or use
P A data flow has a noun phrase label
P.
5.19
19
20
Logic Modeling
Data flow diagrams do not show the logic inside
the processes
Logic modeling involves representing internal
structure and functionality
y of processes depicted
on a DFD
Two methods
Structured English
Decision Tables
5.21
21
5.22
22
Structured English Example
START
Initialize storage
TOTAL.SALES, TOT.COM = 0
23
24
A Simple Decision Table
25
Data Dictionary
Written description of the data contained in the
database
First ones maintained in hardcopy form
Most are now maintained on a computer
Data flow dictionary entry describes data flows
on DFD
26
Data Flow Dictionaryy Entryy
Data flow name: Sales Order
Description:
p The documents that are
filled out by customers to identify
the products, and the
quantities of each, that they
will wish to purchase.
Comments:
27
Description:
p The history
y file of sales order forms,
after the data has been entered into the sales
commission system.
Activity:
Comments:
28
A DFD example
29