Pregled bibliografske jedinice broj: 68135
Partially OrderedRuns: a Case Study
Partially OrderedRuns: a Case Study // Abstract State Machines, Theory and Applications, LNCS 1912 / Gurevich, Yuri ; Kutter, Philipp ; Odersky, Martin ; Thiele, Lothar (ur.).
Berlin: Springer, 2000. str. 131-150 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 68135 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Partially OrderedRuns: a Case Study
Autori
Gurevich, Yuri ; Rosenzweig, Dean
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Abstract State Machines, Theory and Applications, LNCS 1912
/ Gurevich, Yuri ; Kutter, Philipp ; Odersky, Martin ; Thiele, Lothar - Berlin : Springer, 2000, 131-150
Skup
ASM 2000
Mjesto i datum
Ascona, Švicarska, 19.03.2000. - 24.03.2000
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Abstract State Machines; partially ordered runs
Sažetak
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
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
120095
Ustanove:
Fakultet strojarstva i brodogradnje, Zagreb
Profili:
Dean Rosenzweig
(autor)
