Partially OrderedRuns: a Case Study (CROSBI ID 480565)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Gurevich, Yuri ; Rosenzweig, Dean
engleski
Partially OrderedRuns: a Case Study
We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoning. As a case study, we prove in detail correctness and deadlock-freedom for general partially ordered runs of distributed ASM models of Lamport's Bakery Algorithm
Abstract State Machines; partially ordered runs
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
131-150-x.
2000.
objavljeno
Podaci o matičnoj publikaciji
Abstract State Machines, Theory and Applications, LNCS 1912
Gurevich, Yuri ; Kutter, Philipp ; Odersky, Martin ; Thiele, Lothar
Berlin: Springer
Podaci o skupu
ASM 2000
predavanje
19.03.2000-24.03.2000
Ascona, Švicarska