Evolving MultiAlgebras unify all usual sequential computation models - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Evolving MultiAlgebras unify all usual sequential computation models

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
grigorieff.pdf (227.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00455373 , version 1 (10-02-2010)

Identifiers

  • HAL Id : inria-00455373 , version 1

Cite

Serge Grigorieff, Pierre Valarcher. Evolving MultiAlgebras unify all usual sequential computation models. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.417-428. ⟨inria-00455373⟩
104 View
66 Download

Share

Gmail Facebook Twitter LinkedIn More