Skip to content

Data-flow diagram

A structured-analysis diagram representing how data moves among external entities, processes and stores within a system.

Version
v2 · 2026-09-19 · History
Domain-specific #
4035
Domain group
Interdisciplinary & Synthetic
Origin domain
Systems Thinking & Cybernetics
Subdomain
Systems Analysis → Systems Thinking & Cybernetics
Aliases
DFD

Core Idea

It models data transformation and boundary crossing rather than control flow or execution timing, and notation and decomposition level must remain consistent. Sources provide labeled data flows to transforming processes, processes read or write stores and hierarchical decomposition expands a process while balancing its external inputs and outputs. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of systems analysis. It is the domain-specific identity fixed by the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit.

How would you explain it like I'm…

The Where-Info-Goes Map

Imagine drawing a map of a lemonade stand: lemons come in from the store, get squeezed into juice, get kept in a jug, and cups go out to customers. You draw arrows showing where things go and what changes them, not what time they happen. A data-flow diagram is a map like that, but for information.

Where-Data-Goes Map

A data-flow diagram is a drawing that shows how information moves through a system. It uses a few kinds of shapes: outside people or systems that send or receive information, steps that change the information, places where information is stored, and labeled arrows showing information moving between them. It does not show the order or timing of events, only where information goes and how it changes. You can zoom into one step and draw a more detailed diagram of it, but the information going in and out has to match the bigger picture.

Data Movement and Transformation Diagram

A data-flow diagram (DFD) models how data is transformed and moves across a system's boundary. Its parts are external entities (sources and destinations outside the system), processes that transform data, data stores that processes read from or write to, and labeled, directed arrows called data flows. Unlike a flowchart, it deliberately leaves out control flow and timing: it shows what data goes where, not when or in what order steps run. Diagrams are layered: a single process can be expanded into a more detailed diagram, but that lower level must be balanced, meaning its external inputs and outputs match those of the process it expands. Data cannot move directly between two stores or two external entities without passing through a process.

 

A data-flow diagram is a systems-analysis model of data transformation and boundary crossing. It declares a system boundary and a decomposition level and uses four element types: external entities that supply or receive data, processes that transform it, data stores that persist it, and labeled directed data flows connecting them. Sources provide data flows to processes, and processes read from and write to stores. Hierarchical decomposition expands a process into a child diagram, subject to balancing: the child's external inputs and outputs must match the parent process's. The notation excludes control logic and execution timing, and forbids unmediated connections, such as store-to-store or entity-to-store flows that bypass any process. A DFD is therefore distinct from a flowchart, a sequence diagram, or a state machine, which model control or timing, and a diagram that mixes notations or decomposition levels inconsistently fails as a DFD even if it uses similar boxes and arrows.

Scope of Application

Data-flow diagram belongs to systems analysis and is useful where the analyst can specify the typed systems analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit. The scope is broad within that domain but bounded by the need for the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit.

Clarity

The abstraction clarifies a crowded vocabulary by making the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Data-flow diagram. Data-flow diagram compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: the typed systems analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of systems analysis because they reuse the typed systems analysis carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Sources provide labeled data flows to transforming processes, processes read or write stores and hierarchical decomposition expands a process while balancing its external inputs and outputs., and type the carrier, state every parameter and convention in the definition, test that the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Data-flow diagramParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Data-flow diagramDOMAINPrime abstraction: Representation — is a kind ofRepresentationPRIME

Current abstraction Data-flow diagram Domain-specific

Parents (1) — outgoing typed relations

  • Data-flow diagram is a kind of Representation Prime

    It remains its own entry because its identity is fixed by the system boundary and decomposition level, external entities, processes, data stores, labeled directed data flows, notation, balancing across levels and exclusions of control timing and unmediated invalid connections.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Data-flow diagram sits in a crowded region of the domain-specific corpus (5th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Knowledge Representation & Information Systems (31 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25