State Transition Table¶
Overview¶
REVA advances through a deterministic sequence of states.
State transitions are controlled by the packet scheduler and packet executor.
Transition Table¶
| Current State | Condition | Next State |
|---|---|---|
| idle_state | Burst requested | burst_state |
| burst_state | Pulse count reached | gap_state |
| gap_state | More segments remain | burst_state |
| gap_state | Final segment completed | packet_complete_state |
| packet_complete_state | Packet finished | repeat_state |
| repeat_state | Restart packet | idle_state |
State Sequence¶
Idle
↓
Burst
↓
Gap
↓
Packet Complete
↓
Repeat
↓
Idle
Design Principle¶
The state machine is cyclic.
Every packet follows the same sequence.