Interactive small-step algorithms I: Axiomatization

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. Here we extend the axiomatization and, in a companion paper, the proof, 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.

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:3)2007

Citation Source

  • Scopus