napkin.
Menu

CALCULATORS / EMBEDDED TIMING AND DIGITAL SYSTEMS

State transition table memory calculator

Transition-table memory budget for dense state/event representation; no behavior verification.

embedded-state-machine.napkin / editable
✓ checks pass

SCENARIO COMPARISON

Compare the numbers.

This source describes an analytical model. Its quantities and checks are the view.

Scenarioentriesbytes
4896
38.476.8

All calculated quantities are listed with the inputs. Switch to Source to inspect the equations.

SCENARIOS / CALCULATED VALUESSAME SOURCE

Change an input to see the consequences.

transition table fits96.00 ✓ passes

BASELINE INPUTS

CALCULATED

entries48
bytes96

Edits change the baseline source.

Calculated from your source · not saved
Baseline · Baseline
transition table fits96.00 ✓ passes
alternative · alternative
transition table fits76.80 ✓ passes

Illustrative first-order example. Checks are editable requirements, not design standards. The broader topic may require additional equations, data, and validation.

Formula and units

This example uses the following equations. Input names and units match the editable source above.

entries
entries = states*events
bytes
bytes = entries*bytesPerEntry

Original worked example

These are the baseline values in the downloadable source. Edits above let you test your own values.

Given

states
8
events
6
bytes per entry
2
budget
128

Calculated

entries
48
bytes
96

Assumptions and limits

Transition-table memory budget for dense state/event representation; no behavior verification.

The requirement checks use the limits written in this example. Passing a check does not establish that the model covers every load, material behavior, or operating condition in a real design.

Download this .napkin example ↓

Take it further with your agent

Napkin keeps the inputs, equations, checks and assumptions together in one study. Your agent sets it up; you change the numbers.

Try with Claude ↗

codex 'Use Napkin (https://napkin.engineering/mcp, or the local Napkin plugin) to build a study: Finite-state-machine timing. Inputs: states; guards; timers; input scenarios. Outputs: state trace; transition coverage; invariant results. Model scope: Declared clock, peripheral and execution assumptions. Read napkin_capabilities and the current snapshot. Ask me for the values that matter, label assumptions with units, author .napkin source, validate it and apply it with napkin_source using the current revision, then open the study. Add checks for the limits I supply. Keep unsupported analyses explicit.'

Claude needs the Napkin connector; Codex needs the Napkin plugin. Set up your agent ↗

The broader study

The topic brief below describes the broader scope. The worked example above states the particular calculation it implements.

  • Inputs: states, guards, timers, input scenarios
  • Outputs: state trace, transition coverage, invariant results
  • Modes: calculate, compare, sweep
  • Drawing: Timing diagram or event simulation

EXECUTABLE WORKED EXAMPLE · FIRST-ORDER MODEL · CHECK THE SCOPE & ASSUMPTIONS

More in embedded timing and digital systems