Functional Decomposition
Functional decomposition (BABOK 10.22) breaks a process, a system, a functional area or a deliverable into simpler constituent parts, so that each can be analysed, estimated, measured and assigned to someone separately. It serves two ends: managing complexity, by making tractable a subject nobody can grasp in one piece and reducing uncertainty, by breaking a complex value into factors each of which estimates better than the whole. Its discipline comes down to three rules: the children of a node exhaust their parent, every node has exactly one parent and the depth of the tree is a decision, taken according to what the next task will consume. The result can be written as a drawn tree or as an indented numbered list without distinction: BABOK recognises both as representations of the same artifact, which makes the technique practicable with no tool at all.
Goal
Functional decomposition breaks a subject too large to be handled in one piece, a process, a system, a value to estimate, into simpler parts. It attacks two distinct problems, and it is worth knowing which of the two you are treating before you open the session.
The first is complexity. Once broken down, the subject gives a set of parts small enough to be analysed, assigned, measured and estimated independently. Each part can then be tracked in its own right and its success appraised against its sibling parts and against its parent. This is the move that precedes almost all the rest of the analysis work: you do not specify a function you have not first broken down.
The second is uncertainty. Breaking a complex value into its factors reduces the error on the estimate of the whole, and the mechanism carries a condition. Provided the tree is complete, the independent errors made on each factor partly cancel one another, where a single global appraisal concentrates them on a single figure. The condition is a heavy one: an incomplete tree removes the mechanism's foundation, since what is missing from the tree is also missing from the estimate, and the completeness contract explains why the error then becomes systematic. Subject to that reservation, this is why every serious estimating method starts with a breakdown and why an estimate placed on the top of the tree is an invented figure that looks like a calculated one.
BABOK lists eight objectives, and the objective chosen commands the rest: it decides what you decompose, along which axis and to what depth.
- Measuring and managing: isolate the factors that contribute to the result and that are manageable, then attach an indicator to each.
- Designing: simplify a design problem by reducing and isolating the object of design.
- Analysing: study the properties and behaviour of a component apart from its surrounding environment.
- Estimating and forecasting: lower uncertainty by reducing a complex value to its factors.
- Reusing: extract a building block that renders a single service to several processes.
- Optimising: detect or relieve a bottleneck, lower the cost of a function, improve the quality of a process.
- Substituting: make a component replaceable without the whole system being affected.
- Encapsulating: combine several elements into one, the reverse move of decomposition.
The deliverable is the tree itself, drawn or written as a numbered list, together with two things that decide its usefulness. A node dictionary first: for each leaf, a one-sentence definition, an owner and the measure or the estimate it carries. Then the three decisions that produced the tree: the objective, the decomposition axis chosen and the stopping rule applied. A tree delivered without those three decisions cannot be argued with and is therefore unusable: nobody can say any longer whether a node is missing, whether the depth is right or why the breakdown follows this axis rather than another.
Usage
When to use it
- Subject too large to be analysed in one piece: break it down before any other technique can be applied to it.
- Estimating or framing a scope: costing a project, a portfolio or a budget presupposes a prior breakdown.
- Attaching an indicator: tie a measure or a cost to a factor somebody can manage.
- Hunting a bottleneck: isolate the component that carries the cost or the delay before committing to an optimisation.
- Make-or-buy decision: locate the reusable or replaceable component, service extraction, choice of a package.
- Heterogeneous stakeholder group: the tree gives a shared picture of a complex subject.
- Breaking an epic down to a deliverable story: the base move of the scaled agile frameworks, under a per-story value constraint.
- Distributed team: the artifact is an indented list, it lives in a shared document with no wall and no sticky notes.
When not to use it
- Tightly coupled system with emergent behaviour: the value is in the interactions, move to the data flow diagram or to interface analysis (10.24).
- Question of sequence or of timing: containment says nothing about order, reach for process modelling (10.35).
- A standard breakdown already published (APQC PCF, MIL-STD-881, a package's module map): adopt and adapt it rather than rederiving it.
Description
The choice of subject
The mechanics of the tree are the same everywhere. What distinguishes a functional decomposition from another breakdown technique is the subject placed at the root. BABOK draws up the list, and it is to be read as a starting menu.
- A business outcome: income, margin, expense, a volume of production or of service, broken into its factors.
- The work to be done: the breakdown of an endeavour, a project or a programme, into phases, milestones, work activities, tasks, work items and deliverables. BABOK names this decomposition itself: it is the Work Breakdown Structure (WBS).
- A business process: to measure it, manage it, optimise it or reuse parts of it.
- A function: to enable its optimisation or its implementation.
- A business unit: to reverse-engineer and redesign it.
- A solution component: to design, build or change it.
- An activity: to implement, modify, optimise, measure or estimate it.
- A product or a service: to design, deliver and improve it.
- A decision: by identifying its inputs, the models it rests on, its dependencies and its outcomes.
An ambiguous root produces a tree that means nothing, and the ambiguity is almost always a confusion of subject. "Claims management" and "Replacing the claims management system" are two legitimate roots, one is a function, the other is work, and mixing them on a single level is the most common defect of the technique.
The two contracts
The first contract is completeness: the children of a node completely describe their parent. PMI retains it as a fundamental characteristic of the WBS in its Practice Standard for Work Breakdown Structures, under the name of the 100% rule, and it holds identically here: the sum of the children is the parent. The practical consequence is arithmetic. An incomplete tree biases the estimate in a single direction, since what is missing is never negative: the error is a systematic underestimate, and it grows with every forgotten node. The check is made at every level, by putting a single question to the group: if we did everything written here, would we have done the whole parent.
The second contract is the single parent: every node hangs from exactly one parent, which makes the structure a tree in the strict sense, and BABOK states it plainly: any sub-component has only one parent in the functional hierarchy. This contract looks formal until the moment it bites, and it always bites in the same place: the shared node. A capability legitimately serves two parents, document scanning, authentication, invoicing, a mailing. Two answers are correct and a third is wrong.
- Lift the node to the level where it has only one parent and place it as a sibling of those it serves. The tree becomes asymmetric, and that is the sign that it says something true about the organisation.
- Model it once as a reusable building block and reference it from the nodes that call it. This is BABOK's Reusing objective, and it is the route to take when the block has an owner and a cost of its own.
- Duplicating it under both parents is the wrong answer. Every estimate, every cost and every headcount built on the tree is then counted twice, and the 100% rule is violated invisibly, since both branches look complete.
Running the decomposition
BABOK gives the elements of the technique rather than a numbered procedure. Practice orders those elements into a sequence, every rule it applies coming from the standard or from the sources cited.
- Fix the objective, among the eight. Without an objective there is no stopping rule, and the tree grows until the room is tired.
- Name the subject and its boundary. Write the root as an unambiguous statement and say what is out of scope. Scope modelling (10.41) draws that boundary, decomposition details what is inside it.
- Choose the decomposition axis: by function, by outcome, by deliverable, by life-cycle stage, by product, by organisational unit. BABOK poses this as a limitation of the technique: every complex subject admits several valid decompositions. The axis is a choice, it is justified by the objective and it is written down.
- One axis per level. A level that mixes "by product" and "by region" makes the siblings overlap, and the completeness check passes while the count is wrong.
- Decompose one level at a time, breadth before depth. At every level, verify both contracts before going down.
- Name the nodes consistently within a level: verb and object for a function or an activity (validate an invoice), a noun for a deliverable or an outcome. Naming that flips mid-level is the first symptom of a mixed axis.
- Handle the shared nodes by lifting them a level or by modelling them once as a reusable block.
- Apply the stopping rule, stated before the session and verifiable.
- Number the nodes (1, 1.1, 1.1.2). The numbering is what makes the tree citable from a requirement, an estimate or a traceability matrix, and it must stay stable from one version to the next. Renumbering a tree that is already cited breaks every reference that pointed at it.
- Validate through four mechanical checks, then with the owners of the parts: coverage (do the children make the parent), overlap (do two siblings claim the same thing), single parent and use (can the downstream task consume this tree, at this depth).
The stopping rule
BABOK sets the principle: you stop when the business analyst has just enough understanding and detail to proceed and can apply the result in the execution of the following tasks. Depth is therefore a decision, and it is deduced from the task that will consume the tree. What remains is to make it operational. Two formulations hold up well in practice, and one of them has to be chosen before the session.
- To estimate: a leaf is an activity executed by a single role with a single system, whose cost or duration can be estimated within the tolerance the objective demands.
- To measure and manage: a leaf can be assigned to a single owner and tracked by a single indicator.
One consequence follows: depth is uneven. One sub-function goes down three levels because that is where the cost hides, its neighbour stops at one because nobody needs to look there. A symmetric tree, where every branch has the same number of levels and roughly the same number of children, rarely describes a real organisation, and it should be read as the sign that a stopping rule was applied out of habit.
Functional decomposition, WBS, process model and mind map
The technique sits between two neighbours, and both boundaries are drawn on the same criterion: the subject placed at the root and the consumer of the tree.
The Work Breakdown Structure (WBS) is a functional decomposition, the one whose subject is the work to be done. BABOK says so in those terms: the mechanics are identical, the two contracts are the same and PMI retains the 100% rule as a fundamental characteristic of this variant. What changes is the subject and the consumer. A decomposition of a function says what the organisation does, it exists independently of any project and it outlives it; it is read by the analyst, to frame a scope, structure requirements or attach measures. A WBS says what a project will produce, it is born and dies with the project; it is read by the project manager, to build a schedule, a budget and assignments.
On an agile project, the PMBOK Guide maps the WBS onto the product backlog, whose items break down into epics and then stories. The correspondence is one of role, structuring the work to be done. It does not carry the completeness contract over: the backlog is a prioritised list of the known items, where the predictive WBS exhausts its parent.
Process modelling (10.35) carries order and flow: what follows what, who executes it, where it branches, what loops. A decomposition carries containment alone: the parent, its children, the levels. The two compose: the leaves of a functional decomposition are the processes and activities you go on to model. The sign that a decomposition has drifted is immediate: an arrow appears between two siblings, or somebody starts reading the tree left to right as a chronology. At that instant it is a bad process model.
When the subject at the root is a process, process management gives the levels names of its own. The ABPMP's BPM CBOK offers an example set of four: the enterprise process model, the business process model, the workflow model and the task steps, the first three tied to a perspective on the organisation, from executive management to the process owner and then to operations. The number of levels and their names vary with the methods and naming conventions of each company. The guide attaches an alignment rule to this hierarchy: the information carried at one level aligns with the information at the level above, to which it adds further detail.
The mind map (10.29) is associative, radial and generative: it is used to explore and to remember, it has no completeness rule, it tolerates the same idea appearing on two branches and imposes no single parent. The confusion between the two is common because BABOK cites the mind map among the possible representations of a decomposition's result: a mind map can therefore carry a decomposition, provided the decomposition was first put through the two contracts. The mind map is the only one of these techniques where both contracts are absent, and that absence makes plain what the contracts cost and what they buy.
| Functional decomposition (BABOK 10.22) | Process model | Mind map | ||
|---|---|---|---|---|
| Decomposition of a function | WBS (work to be done) | |||
| Technique | 10.22, subject = a function | 10.22, subject = the work to be done | 10.35 | 10.29 |
| Subject | what the organisation does: function, sub-function, process, activity | the work of a project or a programme: phases, work packages, deliverables | the running of a process | free: whatever the author associates with the central theme |
| Node | a function, named verb and object | a deliverable or a work package | a step, a decision, an event | an idea |
| Relation carried | containment | containment | sequence, flow, branching | association |
| Rule | exhaustive children, single parent | the same, retained as a fundamental characteristic by PMI (the 100% rule) | every step has an input and an output | no completeness, no single parent |
| Lifespan | stable, independent of projects | that of the project | that of the process | that of the session |
| Reader | the analyst: scope, requirements, indicators, reuse | the project manager: estimate, schedule, budget, assignment | the process performer and the process designer | the author, first of all |
The pitfalls
Mixing axes on a single level
Siblings split "by product" and "by region" overlap. The completeness check passes, the count is wrong and the estimate built on it double-counts part of the scope. The test is one question: can two siblings claim the same franc of cost or the same customer. If they can, the axis is mixed.
Decomposing deeper than the consumer uses
A five-level tree whose estimate never reads past the second is documentation debt: it costs to produce, it costs to keep current and it rots from the bottom. The test is to name, for every level, the downstream task that will read it. A level with no named reader is deleted.
Mistaking the tree for the system
BABOK makes this an explicit limitation: many systems cannot be fully represented by simple hierarchical relationships, because the interactions between components produce emergent behaviours. A hierarchy hides the couplings, and a tree that suggests its branches are independent when they are not misleads the estimate as much as the design. Systems engineering handles the problem by pairing logical decomposition with an explicit allocation of requirements to components.
Freezing the first decomposition that comes
Every complex subject admits several, sticking with the first one misses better options and exploring them all costs too much. The tension is real and BABOK leaves it open, which makes it the point where the assistance of a model has measurable value.
Decomposing on absent or wrong information
The tree looks authoritative long before it is correct, and the revision, partial or total, arrives once everybody has already leaned on it. The PMBOK Guide gives the way out: develop the branch whose deliverable is agreed, hold the others at a coarse grain for as long as theirs is not. If the tree carries an estimate, see rolling wave estimation.
Tracing the org chart
Decomposing a function by who does it today carves the current organisation into the model and makes any redesign invisible. The symptom is visible to the eye: the second level of the tree is the list of departments.
Duplicating a shared node
The double count is silent, since both branches look complete. It is the one violation of the technique that a text search detects: two nodes bearing the same name under two different parents.
Letting sequence in
An arrow between two siblings, a "then" in a label, a left-to-right reading in time. The test is put to the author in one question: does the order of the siblings carry meaning. An affirmative answer signals that the tree is carrying time, and time is modelled elsewhere, in a process model.
AI considerations
The gain specific to this technique sits in the limitation BABOK leaves open: every complex subject admits several valid decompositions, sticking with the first one can cost the best solution and exploring them all is prohibitively expensive. That was a cost trade-off, and a large language model changes the price of it. Asking for the same function decomposed along three distinct axes, by function, by outcome, by customer journey, takes a few minutes, and the value sits in the places where the three trees diverge. A node that appears in one tree and vanishes in the other two is either a function the dominant axis masks or an invention of the model, and both deserve the question. The axis retained is still the one that serves the objective, and that choice belongs to the analyst.
The second use is the mechanical verification of the rules, and this is the work the machine does better than a human tired at the end of a workshop. The technique's contracts are formal, therefore checkable: a node appearing under two parents, a level whose siblings visibly mix two axes, naming that switches from verb-and-object to a noun in the middle of a level, a branch taken lower than the stated stopping rule, children that manifestly do not cover their parent. You supply the tree and the stopping rule, and you ask for the list of violations.
The third use is the first draft. Starting from a public reference, the APQC PCF or a package's module map, a model proposes a starting tree faster than a blank page. It is a draft to be contested: the workshop saves time on the shaping, never on the validation.
Three limits are firm. The objective and the stopping rule are business decisions: a model will happily decompose forever, and the useful depth depends on what the next task needs, information it does not have. Completeness cannot be generated: whether these children genuinely cover this parent is a question about this organisation, and the model will invent a plausible function or omit a real one with the same assurance, both errors presenting themselves in equally well-written prose. Finally, symmetry betrays generation: a tree where every node has three children and every branch has the same depth was produced by the machine, and it should be reread looking first for what it smoothed over. One last point is elementary prudence: a tree of functions is a map of the company and of where its costs sit, which makes it a sensitive document before it is a deliverable.
Examples
Decomposition of a function
A Swiss health insurer decomposes its Claims management function, within the scope of compulsory health insurance (LAMal/KVG). The objective retained is measuring and managing: attach a processing cost and a lead time to every sub-function, before deciding where to automate. The subject is a function, the axis is functional and the stopping rule is stated before the session: a leaf is an activity executed by a single role with a single system, whose unit processing cost can be estimated.
- Claims management function
- Receipt of claims sub-function
- Receipt under tiers payant (invoice from the healthcare provider)
- Receipt under tiers garant (receipt submitted by the insured person)
- Scanning and data extraction shared node, lifted one level: it serves 1.1.1 and 1.1.2, and the single-parent rule forbids duplicating it under both
- Claim checking
- Check of cover at the date of the service
- Catalogue check
- Outpatient tariff check (TARDOC and outpatient flat rates)
- Specialities List check (medicines)
- LiMA check (medical aids and appliances)
- Economic efficiency check (art. 56 LAMal/KVG)
- Calculation of the cost sharing
- Charging of the deductible
- Calculation of the retention fee
- Contribution to the costs of the hospital stay
- Payment and statement
- Payment order
- Statement to the insured person
- Dispute and objection
- Reassessment of the file
- Formal ruling and handling of the objection
- Receipt of claims sub-function
Stopping rule applied: one activity, one role, one system, an estimable unit cost. The third level satisfies it everywhere except under 1.2.2, which has to go one step lower. The stopping line is therefore stepped, and it is the rule that drew it.
One rule, several depths: the uneven depth of the tree is a result of the stopping rule, applied node by node, and a tree whose branches all ran to the same level would signal that nobody applied it.
Decomposition of a business outcome
The same subject decomposes along a different axis when the objective changes. To estimate and forecast, what you decompose is an outcome: annual co-payment = deductible + retention fee + hospital contribution, three factors fixed by federal regulation and applied to two adult insured persons.
| Factor | Insured person A | Insured person B |
|---|---|---|
| Annual cost of services borne by the insurer | CHF 4'300 | CHF 12'300 |
| Deductible (ordinary, adult, per calendar year) | CHF 300 | CHF 300 |
| Base of the retention fee (costs less deductible) | CHF 4'000 | CHF 12'000 |
| Retention fee at 10%, capped at CHF 700 | CHF 400 | CHF 1'200 reduced to the cap of CHF 700 |
| Chargeable days of hospitalisation | 0 | 10 |
| Hospital contribution (CHF 15 per chargeable day) | CHF 0 | CHF 150 |
| Total co-payment | CHF 700 | CHF 1'150 |
The work to be done in the same organisation
The health insurer launches the project replace the claims management system. The subject becomes the work to be done, and the decomposition takes the name of WBS: same mechanics, the same two contracts, an entirely different content. Work package 4 is taken down one level, where a package becomes estimable and assignable to a team.
- Framing
- Design
- Build
- Data migration
- Source data mapping
- Transformation rules
- Load and replay
- Reconciliation and validation
- Acceptance testing
- Go-live
- Project management
The lowest element of a WBS is the work package. PMI's Practice Standard for Work Breakdown Structures stops the decomposition at that level and pairs each element with a WBS dictionary entry, a description of the work the element covers. DIN 69901, the standard behind the Projektstrukturplan used across the German-speaking project world, defines the work package (Arbeitspaket) as the lowest element of the plan, assignable to a single owner and carrying a defined scope, effort, cost, dates and result. The two agree on the essential: below the work package the tree stops, and every work package carries a description of a fixed shape.
| Field | Content, work package 4.4 |
|---|---|
| WBS code | 4.4 |
| Name | Reconciliation and validation |
| Deliverable / result | Signed reconciliation report: the migrated claims data matches the source, record counts and control totals reconciled |
| Work carried out | Compare the migrated records against the frozen source extract, reconcile record counts and financial control totals, clear every exception |
| Responsible owner | Migration team lead (single owner) |
| Inputs / preconditions | Work package 4.3 Load and replay completed, source extract frozen, reconciliation rules agreed |
| Acceptance criteria | No unexplained exception, control totals matching to the franc, sign-off by the business owner of Claims management |
| Effort and cost | 12 person-days, CHF 14'000 |
| Schedule | 2 weeks, weeks 18-19 |
| Dependencies | Depends on 4.3, blocks 5 Acceptance testing |
The PMBOK Guide sets a level above the work package, the control account: the management control point where scope, budget and schedule are brought together and compared against the work performed, to measure progress. A control account groups at least two work packages and each work package belongs to a single control account. Between the control account and the work package sits the planning package, whose work content is known but whose activities are not yet placed in the schedule. The four work packages of branch 4 form a control account here, where package 4.4 amounts to 12 person-days and CHF 14'000.
Visualisations
BABOK devotes one of its four elements to the representation of the result, and it imposes none of them. A decomposition is expressed as a textual description, as a hierarchical list, in a formal notation (a mathematical formula, BPEL, a programming language) or as a diagram, and the standard names ten families of admissible diagrams. The drawn tree is the default form, and on some subjects it is the wrong choice.
The governing rule is always the same: the representation follows the subject. The subject placed at the root decides what you decompose and the form in which the result is written. A decision decomposes into a decision tree or into DMN, because the logic that leads to the outcome must stay legible. A solution component decomposes into a component diagram, because that is where the wiring between the blocks becomes visible. A business outcome decomposes into a formula, and the participation-facteurs table is exactly that: a formal notation in BABOK's sense, which looks nothing like a tree and is nonetheless one, with three factors that exhaust their parent.
A second criterion settles what the subject leaves open: the consumer decides the medium. A tree that feeds an estimate lives in a spreadsheet, because that is where the leaf loads roll up to the top. A tree meant for a review in a room is drawn, because the irregular depth and the stopping line are seen and not read. Choosing the representation before knowing who consumes it produces a document nobody will open twice.
| Subject at the root | Representation that follows | What it carries that the tree alone does not |
|---|---|---|
| A business outcome | formula, factor tree, formal notation | the rules that link the factors and their non-additivity: a cap that saturates, a rate that changes. This is what the participation-facteurs table does |
| The work to be done | WBS, numbered hierarchical list | the roll-up of loads and costs to the top, leaf by leaf and numbering citable in a contract |
| A business process | flow diagram and the data flow diagram (10.13) | the flows between the children. A levelled DFD is a decomposition, which additionally carries what each node consumes and produces, something a containment tree cannot say |
| A function, a business unit | tree diagram, nested diagram | the depth, the irregularity and the stopping line, at a single glance. The nested diagram drops the edges when the levels are few and the siblings many |
| A solution component | component diagram | the wiring: which component calls which and through which interface. This is what serves the designing and substituting objectives |
| A decision | decision tree, DMN | the logic leading to the outcome and the range of outcomes. The consumer is a rules engine as much as a human |
| A higher-level use case | use case diagram | the cases it includes and the actor from whom the behaviour is seen |
| The behaviour of an object | state transition diagram | what happens inside a composite state, which containment alone does not describe |
| The causes of a complex outcome | cause-effect diagram | the events and conditions that produce the outcome, when the parts are causes rather than pieces |
| An exploration, categories | mind map (10.29) | free association, including across branches. It can carry the result, it does not police it: no completeness, no single parent |
| Any subject, consumer = a machine | formal notation: BPEL, a programming language | executability and verification of the two contracts by the machine |
The choice of representation excuses no check, and the review bears everywhere on the same points, three of which the pitfalls already name: the regularity of the branches, the content of the second level and the nature of the edges. What the drawing changes is the speed at which they are seen. A representation that makes a pitfall invisible is a bad choice, and that is the case of the mind map for the single parent, which it has no means of flagging.
Cost
| Phase | Level | Justification |
|---|---|---|
| Preparation | Medium | Three decisions are taken before the session and condition everything else: the objective, the decomposition axis and the stopping rule. To these is added the composition of the group, which must between them cover the whole of the parent, failing which the part of the scope nobody represents will disappear from the tree without anyone noticing. No data preparation, no tooling. |
| Execution | Medium | One or two workshops of two to three hours for a mid-sized function, plus a validation round with the owners of the parts. The effort grows with the depth, each level multiplying the number of nodes, and that is precisely what the stopping rule serves to contain. |
| Documentation | High | The tree becomes a living reference: it feeds the estimate, the scope and the traceability, so its numbering must stay stable and its content must follow every evolution of the functions. This is the dominant item and the only one that never stops. A tree that is not kept current goes on carrying authority while becoming false, and it needs a support that genuinely holds it, a repository or a modelling tool, failing which it degrades into a forgotten slide deck inside a quarter. |
Tooling
The whiteboard and sticky notes, physical or in a shared-board tool (Miro, Mural, FigJam), serve the derivation session. Their advantage is unique: as long as the axis is still under discussion, moving a node from one branch to another is free, which is true in no structured tool.
The indented list in a document or a spreadsheet is the cheapest complete artifact, and BABOK explicitly recognises it as a valid representation of the result. The spreadsheet adds what the document lacks: a level column, an estimate column per leaf and a sum that rolls up the tree. That is what turns the decomposition into an estimate, and it is often all a project needs.
Tree and mind-mapping tools (XMind, FreeMind, draw.io, Lucidchart, Visio) take over as soon as the diagram has to be published, reviewed or embedded in a document. They draw, they check nothing: neither completeness nor the single parent.
Work management tools carry the tree natively when the subject is the work to be done: Jira and Azure DevOps hold the epic, feature and story hierarchy, MS Project holds a WBS with its numbering and its effort roll-ups.
Modelling and enterprise architecture tools (Sparx Enterprise Architect, Archi for a function decomposition in ArchiMate, ARIS, Signavio, Bizagi) are the only tier where the tree becomes a first-class object, traced to requirements, processes and applications and reusable from one project to the next. It is the tier to choose when the decomposition has to live beyond the project that produced it, and the documentation cost is the argument that justifies it.
Two formal notations are worth knowing. IDEF0, standardised as FIPS PUB 183, remains the reference notation of functional decomposition: it imposes a strict numbering of the levels (A-0, A0, A1, A11), a bounded number of children per node and above all the consistency between a diagram and its parent, which neither a spreadsheet nor a drawing tool verifies. DMN serves when the subject is a decision. Finally, a published reference often supplies a defensible starting tree: the APQC Process Classification Framework for enterprise processes, MIL-STD-881 for an industrial WBS, a package's module map for a tooled domain.
Sources
- IIBA, A Guide to the Business Analysis Body of Knowledge (BABOK Guide) v3, §10.22 Functional Decomposition: the definition, the eight objectives, the subjects of decomposition, the two contracts, the level of decomposition and the representations of the result.
- NIST, FIPS PUB 183, Integration Definition for Function Modeling (IDEF0), 1993: the reference notation of functional decomposition and its discipline of levels.
- PMI, Practice Standard for Work Breakdown Structures, third edition: the 100% rule, retained as a fundamental characteristic of the WBS, and deliverable-oriented decomposition.
- PMI, A Guide to the Project Management Body of Knowledge (PMBOK Guide), 8th edition, §4 Inputs and Outputs, "Scope baseline": the control account and the planning package, the two levels above the work package. Also §5 Tools and Techniques, "Decomposition" (deferring the decomposition of a far-off deliverable) and §2.2.2.4 Develop Scope Structure (the correspondence between the WBS and the product backlog).
- ABPMP, Guide to the Business Process Management Common Body of Knowledge (BPM CBOK), §3.5 Process Model Levels: an example set of four process model levels (enterprise process model, business process model, workflow model, task steps), whose number and names vary with each company's conventions, the perspective on the organisation attached to the first three and the rule that each level aligns with the one above it.
- DIN, DIN 69901-5, Projektmanagement – Projektmanagementsysteme – Teil 5: Begriffe: the Projektstrukturplan (work breakdown structure) and the definition of the work package (Arbeitspaket) as the lowest element of the plan, assignable to a single owner with a defined scope, effort, cost, dates and result.
- NASA, Systems Engineering Handbook, §4.3 Logical Decomposition: logical decomposition and the allocation of requirements to components, the treatment of the couplings a hierarchy alone hides.
- APQC, Process Classification Framework: a published, adaptable functional breakdown of an enterprise, to be taken up rather than rederived.
- US Department of Defense, MIL-STD-881, Work Breakdown Structures for Defense Materiel Items: a standardised WBS, the type case of the starting reference.
- Scaled Agile, Story: the SAFe decomposition chain, from epic to capability, to feature and then to story, and the per-story constraint of deliverable value.
- FOPH, Health insurance: Premiums and co-payment: the deductible, the retention fee and its cap, the contribution to the costs of hospital stays, the figures of the worked example.
- FOPH, TARDOC et forfaits ambulatoires: le nouveau tarif médical (published in French and German): the tariff in force since 1 January 2026 for outpatient medical services.

