Abstract

State Machines" (ASM). 13.4.1 Evolving algebras (abstract state machines) The basic idea of the "evolving algebras" (see, for instance, [Gur93,Gur95]) is perfectly summarized by their name. Essentially an evolving algebra (specification) consists of a description of a (nonlabeled) transition system, whose states are algebras on the same homogeneous signature built over the same universe (including Boolean values). Some of the operation symbols are qualified as "static" and their interpretation is the same in any (algebra which is a) state. The transitions are defined by rules of the following form: econd ) up 1 ; : : : up k where, for each j = 1; : : : ; k, the function update up j has form f j (e j 1 ; : : : ; e j n j ) := e j ; econd, e 1 1 , : : : , e 1 n1 , e 1 , : : : , e k 1 , : : : , e k nk , e k are "descriptions" (any possible mathematically intelligible expressions) of elements of the universe, the first describing a Boolean value, and for j = 1; : : : ; ...

Citations