An Introduction to Residuality Theory
summary
Residuality theory models software as interconnected leftovers and claims architects can design for unknown stressors by combining random simulation of business shock scenarios with an explicit N K P analysis (nodes, links, bias) and incidence matrices that expose hidden couplings. The method produces a residual architecture—tested with a residual index (y−x)/S—and is demonstrated on EV fast‑charger software by adding ALPR, per‑minute billing, redundancy and CCTV to survive surprising attractors like vandalism or political “icing.” Early research reports a statistically significant shift toward criticality.
AI-written summary · about
chapters (18)
- 0:00Intro
- 2:44Order and Disorder
- 7:12The Problem with X (Stressors)
- 10:51Residuality Theory
- 14:05Random Simulation
- 16:52Kauffman Networks
- 20:27NKP Analysis
- 23:26A Two Step Algorithm
- 24:11Attractor Networks & Residues
- 26:38Residual Architecture
- 27:27Mathematical Leverage
- 30:47Criticality
- 32:56Example: car charging systems
- 33:42Stressor analysis
- 39:51Decomposition & Contagion
- 42:41Incidence Matrix
- 48:14Empirical Proof
- 50:43Residual Analysis
related talks
54mAn Introduction to Residuality Theory
54mAn Introduction to Residuality Theory
53mResiduality Theory
48mAn Introduction to Residuality Theory
50mKEYNOTE: Residuality Theory in Software Architecture
03mBarry O'Reilly im Interview
22mResilience Is Not Enough
16mSAG Expert Interview #12: The Art of Resilient Software Architecture