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 条
  • [31] Algorithms for Manipulating Sequential Allocation
    Xiao, Mingyu
    Ling, Jiaxing
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2302 - 2309
  • [32] On the Convergence of Sequential Minimization Algorithms
    Sargent, R. W. H.
    Sebastian, D. J.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1973, 12 (06) : 567 - 575
  • [33] Sequential Experimentation by Evolutionary Algorithms
    Shir, Ofer M.
    Back, Thomas
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 1095 - 1112
  • [34] To sequential effective experimenting algorithms
    Naumov, A
    KORUS 2003: 7TH KOREA-RUSSIA INTERNATIONAL SYMPOSIUM ON SCIENCE AND TECHNOLOGY, VOL 4, PROCEEDINGS: LIFE SCIENCE, BIOTECHNOLOGY, MEDICINE ENVIRONMENTAL TECHNOLOGY, ARCHITECTURE ENGINEERING EDUCATION SOCIAL SCIENCE, 2003, : 350 - 355
  • [35] Terrain classification by sequential algorithms
    Huang, Y.
    Zamperoni, P.
    DAGM-Symposium, 1991,
  • [36] Minimization algorithms for sequential transducers
    Mohri, M
    THEORETICAL COMPUTER SCIENCE, 2000, 234 (1-2) : 177 - 201
  • [37] Sequential Experimentation by Evolutionary Algorithms
    Shir, Ofer M.
    Back, Thomas
    Knowles, Joshua
    Allmendinger, Richard
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION), 2017, : 828 - 851
  • [38] Sequential Experimentation by Evolutionary Algorithms
    Shir, Ofer M.
    Back, Thomas
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2022, 2022, : 1450 - 1468
  • [39] On the Convergence of Sequential Minimization Algorithms
    Polak, E.
    Sargent, R. W. H.
    Sebastian, D. J.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1974, 14 (04) : 439 - 442
  • [40] ALGORITHMS FOR SEQUENTIAL AND RANDOM OBSERVATIONS
    PETERSEN, DP
    BULLETIN OF THE AMERICAN METEOROLOGICAL SOCIETY, 1968, 49 (11) : 1109 - &
12345