Algorithmic state machine

The algorithmic state machine (ASM) is a method for designing finite-state machines (FSMs) originally developed by Thomas E. Osborne at the University of California, Berkeley (UCB) since 1960,[1] introduced to and implemented at Hewlett-Packard in 1968, formalized and expanded since 1967 and written about by Christopher R. Clare since 1970.

An ASM chart is a method of describing the sequential operations of a digital system.

The Moore type outputs are listed inside the box.

Every unique variable that is assigned a value in the RTL program can be implemented as a register.

The RTL notation is replaced by signals defined in the datapath.

State Name
State box
Decision box used in an ASM chart
Conditional output box