Sequential abstract-state machines capture sequential algorithms

@article{Gurevich2000SequentialAM,
  title={Sequential abstract-state machines capture sequential algorithms},
  author={Yuri Gurevich},
  journal={ACM Trans. Comput. Log.},
  year={2000},
  volume={1},
  pages={77-111}
}
  • Y. Gurevich
  • Published 1 July 2000
  • Computer Science, Mathematics
  • ACM Trans. Comput. Log.
We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded-exploration postulate . Analysis of the postulates leads us to the notion of sequential abstract-state machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider sequential algorithms that may be nondeterministic and that may interact with their environments. 
Concurrent abstract state machines
TLDR
The semantics of concurrent ASMs are defined by concurrent ASM runs which overcome the problems of Gurevich's distributed ASM Runs and generalize Lamport's sequentially consistent runs to form a postulate characterizing an intuitive understanding of concurrency.
Abstract state machines capture parallel algorithms
TLDR
It is shown that every parallel, synchronous algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets.
Sequential algorithms and the computational content of classical proofs
TLDR
A computational interpretation of the rule of dependent choice is developed which is phrased purely on the level of algorithms, giving a clearer insight into the computational meaning of proofs in classical analysis.
On Bounded Exploration and Bounded Nondeterminism
This report consists of two separate parts, essentially two oversized footnotes to the article "Sequential Abstract State Machines Capture Sequential Algorithms" by Yuri Gurevich. In Chapter I, Yuri
A Verification Approach for Distributed Abstract State Machines
  • R. Eschbach
  • Computer Science, Mathematics
    Ershov Memorial Conference
  • 2001
TLDR
This paper shows how a transition level in form of a transition graph may be constructed and can be carried out directly on the transition graph to prove properties related to the state transition level induced by partially ordered runs.
A Behavioural Theory of Recursive Algorithms
TLDR
An axiomatic definition of the notion of sequential recursive algorithm is proposed which extends Gurevich’s axioms for sequential algorithms by a Recursion Postulate and allows us to prove that sequential recursive algorithms are captured by recursive Abstract State Machines, an extension of nd-seq ASMs by a CALL rule.
Simulation of Timed Abstract State Machines with Predicate Logic Model-Checking
We describe a prototype of a simulator for reactive timed abstract state machines (ASM) that checks whether the generated runs verify a requirements specification represented as a formula of a First
The Expressive Power of Abstract-State Machines
  • W. Reisig
  • Mathematics
    Comput. Artif. Intell.
  • 2003
TLDR
The Abstract-State Machine model is characterized as a special class of transition systems that widely extends the class of "computable" transition systems.
On Gurevich's theorem on sequential algorithms
  • W. Reisig
  • Computer Science
    Acta Informatica
  • 2003
TLDR
This work critically examines Gurevich's requirements for sequential algorithms, as well as the semantics of ASM-programs and the proof of his main theorem.
Abstract Effective Models
...
...

References

SHOWING 1-10 OF 57 REFERENCES
Recursive Abstract State Machines
TLDR
This work suggests recursive ASMs, which are essentially a Gurevich abstract state machine and capture recursion properly in the sequential version of the ASM thesis.
Time-bounded random access machines
TLDR
This paper introduces a formal model for random access computers and argues that the model is a good one to use in the theory of computational complexity and shows the existence of a time complexity hierarchy which is finer than any standard abstract computer model.
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs
TLDR
The Linear Time Hierarchy Theorems for random access machines and Gurevich abstract state machines are proved and lower bounds for natural linear time problems are proved.
High Level System Design and Analysis Using Abstract State Machines
TLDR
The ASM approach is non-monolithic and integratable at any development level into current design and analysis environments, and enhances traditional operational modelling and analysis techniques.
Choiceless Polynomial Time
Kolmogoroff algorithms are stronger than turing machines
A predicate is constructed which is recognizable in real time by a Kolmogoroff algorithm but which is not recognizable in real time by a machine with polynomial accessibility.
Church's Thesis and Principles for Mechanisms
Storage Modification Machines
TLDR
This paper gives a complete description of the SMM model and its real time equivalence to the so-called successor RAMS and shows the existence of an SMM that performs integer-multiplication in linear time.
On computable numbers, with an application to the Entscheidungsproblem
  • A. Turing
  • Computer Science
    Proc. London Math. Soc.
  • 1937
TLDR
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Evolving Algebras: an Attempt to Discover Semantics
  • Y. Gurevich
  • Computer Science
    Current Trends in Theoretical Computer Science
  • 1993
TLDR
The collective the authors have learned how to build evolving algebras by the method of successive re nements, and the current evolving algebra description of the C programming language in [GH] doesn't look much like the strcpy example anymore.
...
...