Abstract

Abstract State Machines (hencefort referred to as just ASM) were introduced as ^a€oea computation model that is more powerful and more universal than standard computation models"i¿½? by Yuri Gurevich in 1985. Here we provide some intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for ^a€oepseudocode"i¿½? algorithms is highlighted. Generalizing variants of the fundamental ^a€oesequential small-step"i¿½? version of ASM are also considered.

Links and resources

Tags