Supply Network Modeling: Theory Deep Dive

Foundational theory

Supply Network Modeling is core to Power-Aware Simulation. Treat each power behavior change as a correctness and signoff risk decision.

Core concepts explained

• Model supply nets and supply sets with enough fidelity to reflect real domain dependencies, including shared rails, switched rails, always-on islands, and hierarchical inheritance from top-level supplies into subdomains. Exercise nominal, brownout-like, and transition windows to reveal sequencing bugs that only appear when parent-child supplies move asynchronously. The simulation model should explicitly capture control-to-rail timing assumptions (switch enable, acknowledgment, settle latency) so protocol checks can distinguish valid delay from genuine power-control deadlock or early functional access.

• Primary metric: illegal transition count, corruption incidence, and reproducibility of low-power regressions across fixed seeds

• Primary artifact: LPV evidence packet: transition timeline, assertion outcomes, and before-after replay summary

• Owners: LPV owner, PMU or firmware owner, verification signoff owner

• Power intent and RTL behavior must stay aligned through transitions

• Proof quality beats broad waive strategies in low-power closure

Why this matters in low-power signoff

Power-aware simulation quality depends on faithful domain behavior modeling and deterministic corruption semantics. Teams that enforce this reduce false alarms and real escapes.

Mental model

POWER-AWARE SIM FLOW

UPF + RTL + testbench
        |
        v
Elaboration (PA semantics injected)
        |
        v
Power intent checks (domain, supply, PST)
        |
        v
Dynamic simulation with corruption + clamp behavior
        |
        v
Assertions / scoreboards / waveform triage
        |
        v
Coverage closure + bug replay

Worked intuition

1. Classify symptom first: illegal transition, corruption, isolation break, retention drift, or X-prop ambiguity.

2. Pinpoint first phase boundary where expected low-power behavior diverges.

3. Quantify movement in illegal transition count, corruption incidence, and reproducibility of low-power regressions across fixed seeds before broad refactors.

4. Collect LPV evidence packet: transition timeline, assertion outcomes, and before-after replay summary with fixed run metadata and mode sequencing.

5. Apply one bounded fix and replay both targeted and broader scenarios.

6. Publish owner-signed closure note with rollback trigger.

Common misconceptions

• Passing nominal ON/OFF smoke proves transition correctness.

• UPF compile clean means all intent semantics are correct.

• All X-prop failures indicate real product escapes.

• Retention behavior can be trusted without multi-cycle restore stress.

Low-power verification deep dive

Power-aware simulation quality is measured by realistic transition behavior and actionable failure classification.

Concept diagram

POWER-AWARE SIM FLOW

UPF + RTL + testbench -> elaboration -> transition simulation -> assertions and triage

Metric graph

SIM QUALITY SIGNALS

false-fail noise      █████
actionable failures   ███████
deterministic replay  ████████

Metrics and artifacts to collect

• elaboration semantic report

• power-aware run reproducibility matrix

• corruption and clamp behavior summary

• assertion signal-to-noise trend

Mini case study

A noisy regression became actionable after bucketing failures by transition phase and boundary type before fixing checks.

Debug branches

• Start from first failing phase, not final mismatch.

• Check semantic setup consistency before declaring design bug.

• Use one reproducible scenario per hypothesis branch.

Senior review question

Ask: what exact low-power transition boundary failed first, and which artifact proves the closure claim reproducibly?

Key takeaways

• Tie each LPV claim to a concrete transition boundary and one proving artifact.

• Prefer minimal reversible fixes with explicit owner and rollback criteria.

Common pitfalls

• Treating power-aware failures as random before boundary classification.

• Waiving X-prop failures before proving impact and root cause.

• Declaring closure without deterministic replay across key modes.

Theory reinforcement

Theory matters when it predicts concrete failure signatures and closure boundaries.

Translate LPV semantics into reproducible verification outcomes.