Algorithmic state machine
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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, introduced to and implemented at Hewlett-Packard in 1968, formalized and expanded since 1967 and written about by Christopher R. Clare since 1970. 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.
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, introduced to and implemented at Hewlett-Packard in 1968, formalized and expanded since 1967 and written about by Christopher R. Clare since 1970. 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. ==Further reading== (xiv+418 pages) (7 pages) (NB. This article caused a number of letters to the editor in subsequent issues of the magazine.) (1 page) (NB. Osborne's method was later published by Clare. ) (ix+1+179+3 pages)
Text derived from https://en.wikipedia.org/w/index.php?oldid=1370100209 under CC BY-SA 4.0; modifications have been made.