language: en

An Evolving Algebra Abstract Machine

Giuseppe Del Castillo 1 , Igor D - urd -anovic 2 , Uwe Glasser 1
1 Heinz Nixdorf Institut, Universitat-GH Paderborn,
Furstenallee 11, 33102 Paderborn, Germany,
fgiusp,glaesserg@uni-paderborn.de
2 FB Mathematik-Informatik, Universitat-GH Paderborn,
Warburger Str. 100, 33098 Paderborn, Germany,
igor@uni-paderborn.de

Abstract. Evolving algebras (EAs) as defined by Yuri Gurevich constitute the basis of a powerful and elegant specification and verification method which has successfully been applied to the design and analysis of various kinds of discrete dynamic systems. Aiming at the development of a comprehensive EA-based specification and design environment, we introduce the concept of an evolving algebra abstract machine (EAM ) as a platform for the systematic development of EA tools; for instance, as required for machine based analysis and execution of EA specifications. We give a formal definition of the EAM ground model in terms of a universal evolving algebra, where we validate the correctness of the relation between evolving algebras (their theoretical foundations) and their EAM representation and interpretation. Our approach covers sequential as well as distributed evolving algebras.

Introduction