Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem (CROSBI ID 128745)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Blass, Andreas ; Gurevich, Yuri ; Rosenzweig, Dean ; Rossman, Benjamin Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem // Logical Methods in Computer Science, 3 (2007), 4; 4, 35. doi: 10.2168/LMCS-3(4:4)2007

Podaci o odgovornosti

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

engleski

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem

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 smallstep 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].

Behavioral theory of algorithms ; ASM thesis ; interactive algorithms

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

3 (4)

2007.

4

35

objavljeno

1860-5974

10.2168/LMCS-3(4:4)2007

Povezanost rada

Matematika

Poveznice