Interactive small-step algorithms II: Abstract state machines and the characterization theorem

Published

Journal Article

© A. Blass, Y. Gurevich, D. Rosenzweig, and B. Rossman. 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 a companion paper [5] the axiomatisation 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 ASMs with respect to general algorithms as axiomatised in [5].

Full Text

Duke Authors

Cited Authors

  • Blass, A; Gurevich, Y; Rosenzweig, D; Rossman, B

Published Date

  • November 5, 2007

Published In

Volume / Issue

  • 3 / 4

Electronic International Standard Serial Number (EISSN)

  • 1860-5974

Digital Object Identifier (DOI)

  • 10.2168/LMCS-3(4:4)2007

Citation Source

  • Scopus