2007/07/31 by Andreas Blass, Yuri Gurevich, Dean Rosenzweig +1 · 7 citations
Computer Science · #Abstract state machines #Advanced Database Systems and Queries #Basis (linear algebra) #Characterization (materials science) #Cover (algebra) #Finite-state machine #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #State (computer science) #cs.LO
paper · pdf · doi:10.2168/lmcs-3(4:4)2007
published in Logical Methods in Computer Science Volume 3, Issue 4 (Logical Methods in Computer Science e.V.)
arxiv created 2007/11/05 · openalex publication_date 2007/11/05 · arxiv updated 2015/07/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. In Part I (Interactive Small-Step Algorithms I: Axiomatization), the axiomatization was extended to cover interactive small-step algorithms that are not necessarily ordinary. This means that the algorithms (1) can complete a step without necessarily waiting for replies to all queries from that step and (2) can use not only the environment's replies but also the order in which the replies were received. In order to prove the thesis for algorithms of this generality, we extend here the definition of abstract state machines to incorporate explicit attention to the relative timing of replies and to the possible absence of replies. We prove the characterization theorem for extended abstract state machines with respect to general algorithms as axiomatized in Part I.