Sciweavers

Share
ASM
2000
ASM

Partially Ordered Runs: A Case Study

10 years 5 months ago
Partially Ordered Runs: A Case Study
Abstract. 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.
Yuri Gurevich, Dean Rosenzweig
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where ASM
Authors Yuri Gurevich, Dean Rosenzweig
Comments (0)
books