 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. (October 2024) |
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.[2][3][4] It is used to represent diagrams of digital integrated circuits. The ASM diagram is like a state diagram but more structured and, thus, easier to understand. An ASM chart is a method of describing the sequential operations of a digital system.
- ^ Cite error: The named reference
Osborne_2004was invoked but never defined (see the help page). - ^ Cite error: The named reference
Clare_1970was invoked but never defined (see the help page). - ^ Cite error: The named reference
Clare_1973was invoked but never defined (see the help page). - ^ Cite error: The named reference
House_2012was invoked but never defined (see the help page).