Skip to content
Dynamic Corporate Transformation

Vol. I, Ch. 9 · Part 3. Enterprise Architectures · Week 5

Enterprise State Architecture

Learning outcomes

After completing this chapter, the reader should be able to:

  1. Define the Enterprise State Architecture mathematically as the triple AS=(X,R,C)\AS = (\Xc, \mathcal{R}, \mathcal{C}).
  2. Construct enterprise state architectures for complex organizations: components, interfaces, wiring, and constraints, declared to contract standard.
  3. Identify state hierarchies and state dependencies, including the intrinsic causal hierarchy every dependency structure owns.
  4. Represent enterprise subsystems within a unified state architecture, and reassemble global behavior from wired components.
  5. Analyze enterprise structural consistency: interface, constraint, and hierarchical consistency, and the exact role of cycles in defeating local checks.
  6. Model interactions among enterprise states through the dependency graph, with propagation bounds along its paths.
  7. Evaluate architectural completeness relative to declared question classes.
  8. Interpret enterprise architectures graphically and mathematically, including the one-directional trust rule for aggregated dependency maps.
  9. Assess enterprise structural complexity with graph measures, and know what such measures do not measure.
  10. Prepare enterprise state architectures for the capital, performance, and risk architectures and their integration within UETA.

Reading guide

Work through the chapter in section order; the full development, proofs, and worked examples are in the book — this page indexes them and does not replace them.

  1. Motivation for Enterprise State Architecture

    Motivation for Enterprise State Architecture

  2. Architecture versus Representation

    Architecture versus Representation

  3. Enterprise Topology and State Dependencies

    Enterprise Topology and State Dependencies

  4. Structural Dependency and Propagation

    Structural Dependency and Propagation

  5. Hierarchical Enterprise States

    Hierarchical Enterprise States

  6. Architectural Constraints and Consistency

    Architectural Constraints and Consistency

  7. Architectural Completeness and Validation

    Architectural Completeness and Validation

  8. Architecture Metrics and Complexity

    Architecture Metrics and Complexity

  9. Worked Examples

    Worked Examples

  10. Preparation for Enterprise Capital Architecture

    Preparation for Enterprise Capital Architecture

  11. Chapter Summary

    Chapter Summary

  12. Exercises

    Exercises

  13. Notes and Sources

    Notes and Sources

On the map

AXIOM

This chapter is instrumented by:

Launch the module, load the chapter model, modify inputs, run the optimization, and compare against the worked examples in the book.

Exercises

19 exercises, grouped A concept checks · B mathematical · C computational · D enterprise applications. Starred (★) exercises are on the advanced track. Full solutions appear in the Instructor's Manual, Chapter 9.

A. Concept checks

  1. 9.1
    Distinguish representation from architecture in two sentences, and give one enterprise question answerable from the representation alone and one requiring the architecture (the wiring), justifying each.
  2. 9.2
    For an enterprise you know, list six dependencies and classify each by Table (see book)'s types; identify one edge carrying multiple types and state which type each of two named analyses would read.
  3. 9.3
    Explain the terminological note in Definition (see book): what does "topology" mean here, what did it mean in Chapter 3, and what single idea do the usages share?
  4. 9.4
    Using Meridian (Example (see book)), explain in one paragraph how the intrinsic causal hierarchy can disagree with the organizational hierarchy and why the disagreement predicts coordination cost.
  5. 9.5
    State in plain language why three policies can be pairwise compatible and jointly infeasible, and name the graph property that makes this possible and the one that forbids it.

B. Mathematical exercises

  1. 9.6
    Write out in full the proof that the condensation is acyclic (Proposition (see book)), including the composition-of- paths step, and exhibit a 66-node digraph with exactly two nontrivial SCCs whose condensation has depth 33.
  2. 9.7
    Re-prove the propagation bound (Theorem (see book)(ii)) with all induction details: state the induction hypothesis as a set equality of unaffected components, verify the in-neighbor distance inequality, and identify exactly where the proof uses that component updates read only in-neighbors.
  3. 9.8 ★
    Complete the activation splice of Theorem (see book)(iii): given a path u=w0→⋯→wm=vu = w_0 \to \cdots \to w_m = v with each edge's dependence active at some state configuration, construct a single configuration and horizon at which perturbing uu alters vv, stating the additional hypothesis you need on the ability to steer intermediate blocks (and exhibiting a two-edge example where, without it, the influences cancel).
  4. 9.9
    For the spurious-path counterexample of Theorem (see book)(ii), determine the minimal conditions under which a coarse edge A→BA \to B does certify some fine edge: characterize the aggregates AA for which coarse paths through AA are never spurious (hint: internal connectivity from every in-interface node to every out-interface node).
  5. 9.10
    Complete Theorem (see book)(ii)'s induction as a formal leaf-elimination argument: define arc-consistency projection onto the parent, show projections of arc-consistent families remain arc-consistent on the reduced tree, and conclude by induction on ∣V∣\abs{V}; then explain in one sentence why the same argument fails on a cycle.
  6. 9.11
    Construct a four-constraint family on a 44-cycle of scalar components, all constraints of the form xi−xj≤bijx_i - x_j \le b_{ij}, that is arc-consistent and globally infeasible; state the general infeasibility criterion for difference constraints on a cycle (sum of bounds around the cycle) and verify it on your instance.
  7. 9.12
    Prove that the projection of Theorem (see book)(i) is functorial for walks: concatenation of fine walks projects to concatenation of coarse walks, and lengths never increase; deduce d′([u],[v])≤d(u,v)d'([u], [v]) \le d(u, v) formally.
  8. 9.13 ★
    Magnitude along paths (first synthesis with Part II): suppose each component update is LL-Lipschitz in each in-neighbor block and nonexpansive in its own.

C. Computational exercises

  1. 9.14
    (With AXIOM-09 or the Chapter 9 notebook.
  2. 9.15
    (With AXIOM-09 or the Chapter 9 notebook.
  3. 9.16
    (With AXIOM-09 or the Chapter 9 notebook.

D. Enterprise applications

  1. 9.17
    Write the one-page ESA declaration for an enterprise you know: 66–1010 components with spaces and interfaces, the typed edge list with one witnessing scenario per edge, three scoped constraints, and the intrinsic layering; flag every non-edge you are least confident in as an invariance claim to test.
  2. 9.18
    Write a quarantine memo: for one shock source and one protected component in your Exercise (see book) architecture, list all directed paths between them, identify the smallest set of edges whose removal severs every path, and translate each removed edge into a managerial action with its cost in lost coordination (informal min-cut; the optimization is Volume II).
  3. 9.19
    Conduct a constraint audit in the style of Example (see book): draw GCG_{\mathcal{C}} for eight or more real policies/obligations, compute β\beta, list the cycles, and propose the joint-review calendar the cycles require—one meeting per cycle, memberships attached.

Downloads

All three companions consume the same seeded engine (26109), so their numbers agree by construction — the MFMF convention, carried forward.