Naslov
General Interactive Small-Step Algorithms

Autori
Blass, Andreas ; Gurevich, Yuri ; Rosenzweig, Dean ; Rossman, Benjamin

Izvornik
Microsoft Research Technical Report 2005-113

Vrsta, podvrsta
Ostale vrste radova, elaborat/studija

Godina
2006

Ključne riječi
behavioral theory of algorithms; timing dependence

Sažetak
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 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. In order to prove the thesis for algorithms of this generality, we extend the definition of abstract state machines to incorporate explicit attention to the relative timing of replies and to the possible absence of replies.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

Napomena
Rad je preliminarno objavljen kao Microsoft Research Technical Report 2005-113

POVEZANOST RADA