Evolving Algebras 1993: Lipari Guide

TL;DR

This paper introduces abstract state machines (ASMs) as a versatile computation model capable of simulating arbitrary algorithms, aiming to unify different specification methods and computation models.

Contribution

It formalizes sequential, parallel, and distributed ASMs, supporting the ASM thesis that ASMs can serve as a universal framework for algorithm specification.

Findings

ASMs can simulate arbitrary algorithms step-by-step

Definitions of sequential, parallel, and distributed ASMs provided

Supports the ASM thesis of universality

Abstract

Computation models and specification methods seem to be worlds apart. The project on abstract state machines (in short ASMs, also known as evolving algebras) started as an attempt to bridge the gap by improving on Turing's thesis. We sought more versatile machines which would be able to step-for-step simulate arbitrary algorithms on their natural abstraction levels. The ASM thesis asserts that ASMs are such versatile machines. The guide provides the definitions of sequential, parallel and distributed ASMs.