Presentation is loading. Please wait.

Presentation is loading. Please wait.

Process Modeling – DFD Chao-Hsien Chu, Ph.D. School of Information Sciences and Technology The Pennsylvania State University DFD IDEF.

Similar presentations


Presentation on theme: "Process Modeling – DFD Chao-Hsien Chu, Ph.D. School of Information Sciences and Technology The Pennsylvania State University DFD IDEF."— Presentation transcript:

1

2 Process Modeling – DFD Chao-Hsien Chu, Ph.D. School of Information Sciences and Technology The Pennsylvania State University DFD IDEF

3 Enterprise Modeling Requirement Analysis Normalization Data Modeling Process Modeling Process Analysis Process Improvement Process Redesign Data Management Organization Modeling Network Modeling

4 Building Blocks of Process Process Activity Work Item Data Item

5 What is DFD? DFD, stands for data flow diagram, is a graphical technique that depicts information flow and the transforms that are applied as data moves from input to output. DFD is also known as data flow graph or a bubble chart. A DFD can be seen as a method of organizing data from its raw state.

6 Characteristics of DFD Graphic Partitioned Hierarchic Multidimensional Emphasize flow of data Viewpoint of data and process Materials Information Cash

7 Facts About DFDs Not all models use control information in their DFD. Some models describe manual as well as computer activities in their DFD. DFD’s go from left to right, up and down or other directions. Notations (symbols) in DFDs differ heavily. A minimum or a lot of explaining text around the symbols in a DFD.

8 Symbols for DFD id Text id Data store Process name External Interactor Text External Entity: Source or destination of data Process: Action on data Data Store: Storage of data Data Flow: Data Transfer Yourdon- Constantine Game- Sarson

9

10 Data Flow Diagram Example An employment system An applicant submits an application form, which is reviewed by the personnel section and filed. A request for reference letter is sent to the references named by the applicant. After one-week a summary of reference reports received is prepared and a decision is made whether or not to interview. Unsuccessful applicants are sent a standard rejection letter. An interview is scheduled with likely applicants, and references are stored with the applicant details. Applicants are interviewed and a decision is made on who to hire. Unsuccessful interviewees are sent a commiseration letter, while the successful applicant is sent an employment contract

11 Data Flow Diagram Example An applicant submits an application form, which is reviewed by the personnel section and filed. A request for reference letter is sent to the references named by the applicant. Job Applications Applicant Referees Application Form Request for reference Receive & Review Application

12 Data Flow Diagram Example After one-week a summary of reference reports received is prepared and a decision is made whether or not to interview. Unsuccessful applicants are sent a standard rejection letter. reference data Rejection or Interview Advice Check References Summarise Referees Job Applications Applicant

13 External Entity External entity represents the sources and destination of data created by the system. External entity represents the immediate interface of the system with the external world. When an external source of data is also a destination for data, a loop or occurrence number may be used. In case the destination or use of data created by the process are not known, the flow simply points outside the system. Similarly, data flows may originate from “nowhere”.

14 Process Boxes Each processes box in a DFD describes an action on data. The Identifier. A number indicating the sequence of the process. The Action. A verb specifying the action on which it is performed on the data. The Actor or Place. A noun indicating who performs the action or where it is performed.

15 Data Flow Arrows Data flow arrows link all the process boxes and data stores in DFDs. Data flows should be labeled, except in case the data flows into and out of simple files. DFDs show only the flow of data, not materials. A DFD depicts information flow without explicit representation of procedural logic (e.g., conditions or loops).

16 Data Store Rectangles Data stores can be manual files or computer files. The type of file is not indicated. Only in case the data store is altered the flow is not indicated. A simple access is not indicated. A data store is never the direct recipient of unprocessed data from external sources or from other data stores nor is data from a data store ever directly delivered to an external sources. There must be a process step in between.

17 A data item stored in the data store is read by a process Examples of Data Stores Read W rite Read/ Write A data item is created or deleted or updated in the data store by a process

18 Rules for Constructing DFDs Overall: 1.Know the purpose of the DFD. It determines the level of detail to be included in the diagram. 2.Organize the DFD so that the main sequence of actions reads left to right and top to down. 3.Very complex or detailed DFDs should be leveled. Processes: 1.Identify all manual and computer processes. 2.Label each process symbol with an active verb and the data involved. 3.A process is required for all data transformations and transfers. 4.Do not indicate hardware or where a process is manual or computerized.

19 Rules for Constructing DFDs Data Flows: 1.Identify all data flows for each process, except simple record retrievals. 2.Label data flows on each arrow. Data Stores: 1.Data not indicate file types for data stores. 2.Draw data flows into data stores only if the data store will be changed. External Entities: 1.Indicate external sources and destination of data when known. 2.Number each occurrence of repeated external entities. 3.Do not indicate actors or places as entity squares when the process is internal to the system.

20 DFD Not Allowed Flows

21 If part of our system If not part of our flow ignore

22 Data Flows Only one direction of flow between processes

23 Data Flows Joins & forks allowed only if exactly the same data

24 Data Flows Cannot go directly back to the process it leaves

25 Data Flows Data which moves together should be shown in a single data flow itemised calls invoice payment itemised calls And invoice Pay Invoice Telephone Company Pay Invoice Telephone Company invoice payment

26 DFD Rules IncorrectCorrect

27 DFD Rules Incorrect Correct

28 DFD Rules IncorrectCorrect

29 Naming Use process name as a qualifier Edit Invoice Edited Invoice Verify Invoice Verified Invoice

30 Naming To avoid clutter external agents can be duplicated indicated by a corner line

31 Modeling Procedure Determine requirements/purposes. Divide activities. Model separate activities Construct preliminary context diagram. Construct preliminary level 0 diagrams. Deepen into preliminary level n diagrams

32 Creating a Data Flow Diagram The level 0 should depict the software/system as a single bubble Primary input and output should be carefully noted Refinement should begin by isolating candidate processes, data items and stores to be represented at the next level

33 Creating a Data Flow Diagram All arrows and bubbles should be labelled with meaningful names Information flow continuity must be maintained from level to level One bubble at a time should be refined

34 Producing DFDs Pretend you are looking at the system from above Record where you go and what happens to you as you sit on each data flow in turn, record each process as you as the data flow is being transformed –Start with an high-level summary –Build on this detail –Do not try and draw the final product first time round refine and redraw –Check it

35 Hierarchical DFDs DFDs are hierarchically structured The top-level is referred to as the context diagram (or fundamental system model or the level zero design) the purpose of the context diagram is to define external to the system interfaces and identify system boundaries

36 Hierarchical DFDs The system of interest is usually contained in a single process bubble Subsequent DFD levels will show increasing system detail –label clearly all DFD symbols Stop when –each process is a single decision or operation –each data store has data for a single entity –when every data flow does not need to be split to handle different flows

37 Decomposition Conventions Ensure no information is lost –balancing –hierarchical numbering –add data stores at lower levels, if they are internal to the higher level process, not at context diagram –external agents are introduced at level-0 never at owner levels

38 Level 0 DFD Origin #1 Destination 2 System a b c z r Destination 1 Origin #2

39 Level 1 DFD 1.1 a b c z r 1.2 1.3 1.4 1.5 d e f gh i

40 Level 2 DFD c f 2.1 2.2 2.3

41 Usages of DFDs Requirements Analysis. DFDs has been used to transform users requirements to processes, entities, and data stores. Process Modeling. Systems Implementation. Understanding Communication Improvement

42

43 Thank You? Any Question?

44

45 Balancing The conservation of input and output flows through different levels A B C A B C D E

46 Data-flow models Show the processing steps as data flows through a system Intrinsic part of many analysis methods Simple and intuitive notation that customers can understand Show end-to-end processing of data

47 Data-flow diagrams may be used to show processing at different levels of abstraction from fairly abstract to fairly detailed May also be used for architectural description showing data interchange between the sub- systems making up the system Not a good way to describe system interfaces

48 Data Flow Diagrams They show the overall data flow through a system and they do NOT show –control –order –time –errors It is primarily a systems analysis tool used to draw the basic procedural components and the data that pass among them

49 DFDs Physical –describes operations of existing system, however badly the existing system is performing. This is essential in the fact finding stage of the life cycle Logical –shows the essential processes and data interfaces, without reference to design or implementation Can be Current and NEW current physical or logical new logical

50 DFD Elements Sources and sinks (or external entities or terminators) –a producer or consumer of information that resides outside the bounds of the system to be modelled –can be a person, another system, a program, hardware,… –usually a singular noun is used to name the source or sink

51 DFD Elements Processes (or functions or data transformations) –a transformer of information that resides within the bounds of the system to be modelled –it receives the data and changes it in some way –if not decomposed usually a verb and noun together describe the activity –if decomposed then a verb is used to name the process

52 DFD Elements Data flows (directional) –represent the flow of data item of a collection of data items from one node to another a node can be a process, a source, or a data store –can be input or output information –the arrowhead indicates the direction of data flow –all arrows should be labelled (a data flow into or out of a data store may be nameless in which case it is assumed to carry the entire contents of one record in the store) usually with a singular noun

53 DFD Elements Data stores –a repository of data that is to be stored for use by one or more processes –usually named using a plural noun (the singular describes the individual data items in the store)

54 Naming Too general process names should define a specific action data stores should store only a single structure Receive Data Needed data information Store


Download ppt "Process Modeling – DFD Chao-Hsien Chu, Ph.D. School of Information Sciences and Technology The Pennsylvania State University DFD IDEF."

Similar presentations


Ads by Google