On Gurevich's theorem on sequential algorithms

被引：0
|
作者：
W. Reisig
机构：
[1] Institute für Informatik,
[2] Humboldt-Universität zu Berlin,undefined
[3] Unter den Linden 6,undefined
[4] 10099 Berlin,undefined
[5] Germany (e-mail: reisig@informatik.hu-berlin.de) ,undefined
来源：
Acta Informatica | 2003年 / 39卷
关键词：
Computation Model; Programming Language; Specification Method; Communication Protocol; Standard Computation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Abstract-State Machines have been introduced as “a computation model that is more powerful and more universal than standard computation models”, by Yuri Gurevich in 1985. ASM gained much attention as a specification method, in particular for the description of the semantics of programming languages, communication protocols, distributed algorithms, etc. Gurevich proved recently that a sequential algorithm must only meet a few liberal requirements to be representable as an ASM. We critically examine Gurevich's requirements for sequential algorithms, as well as the semantics of ASM-programs and the proof of his main theorem. A couple of examples support and explain intuition and motivation of ASM.
引用
收藏
页码：273 / 305
页数：32
相关论文
共 50 条
  • [1] On Gurevich's theorem on sequential algorithms
    Reisig, W
    ACTA INFORMATICA, 2003, 39 (04) : 273 - 305
  • [2] Tolerant Bundle of Ways and Gurevich's Theorem for Tolerant Spaces
    Nebaluev, S., I
    Susin, M. N.
    IZVESTIYA SARATOVSKOGO UNIVERSITETA NOVAYA SERIYA-MATEMATIKA MEKHANIKA INFORMATIKA, 2009, 9 (04): : 41 - 44
  • [3] On Helly's theorem: Algorithms and extensions
    Brieden, A
    Gritzmann, P
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 17 (04) : 393 - 410
  • [4] On Helly's Theorem: Algorithms and Extensions
    A. Brieden
    P. Gritzmann
    Discrete & Computational Geometry, 1997, 17 : 393 - 410
  • [5] Efficient algorithms for Petersen's matching theorem
    Biedl, TC
    Bese, P
    Demaine, ED
    Lubiw, A
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 130 - 139
  • [6] Efficient algorithms for Petersen's matching theorem
    Biedl, TC
    Bose, P
    Demaine, ED
    Lubiw, A
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (01): : 110 - 134
  • [7] SEQUENTIAL REGULAR VARIATION: EXTENSIONS OF KENDALL'S THEOREM
    Bingham, Nicholas H.
    Ostaszewski, Adam J.
    QUARTERLY JOURNAL OF MATHEMATICS, 2020, 71 (04): : 1171 - 1200
  • [8] WOLFOWITZ'S THEOREM AND CONSENSUS ALGORITHMS IN HADAMARD SPACES
    Grohs, P.
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 143 (10) : 4403 - 4414
  • [9] SCALING THEOREM AND ALGORITHMS
    BIGELOW, JH
    SHAPIRO, NZ
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 33 (02) : 348 - 352
  • [10] Newton’s method for generalized equations: a sequential implicit function theorem
    A. L. Dontchev
    R. T. Rockafellar
    Mathematical Programming, 2010, 123 : 139 - 159
12345