Computer Science – Logic in Computer Science
Scientific paper
2007-07-25
LMCS 3 (4:4) 2007
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-3(4:4)2007
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.
Blass Andreas
Gurevich Yuri
Rosenzweig Dean
Rossman Benjamin
No associations
LandOfFree
Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547440