Queue
Also: FIFO
A collection where items normally leave in the order they arrived.
A bounded queue requires explicit full, empty, concurrency, priority, and loss behavior.
Example Motion commands wait FIFO while an emergency stop uses a separate guaranteed path.
Common misconception Using circular storage does not require overwriting old items; storage structure and overflow policy differ.