Evolving MultiAlgebras unify all usual sequential computation models

Abstract : It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA ("Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via "literal identifications" to slight extensions of the usual machine models and also to grammar models. Though we modify these models, we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms.
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

Contributor : Publications Loria <>
Submitted on : Wednesday, February 10, 2010 - 11:38:10 AM
Last modification on : Friday, January 4, 2019 - 5:32:56 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 7:55:15 PM


Files produced by the author(s)


  • HAL Id : inria-00455373, version 1



Serge Grigorieff, Pierre Valarcher. Evolving MultiAlgebras unify all usual sequential computation models. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.417-428, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00455373〉



Record views


Files downloads