Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

ASM
2000
ASM

favoriteEmaildiscussreport

105views Computational Biology» more ASM 2000»

Partially Ordered Runs: A Case Study

14 years 3 months ago

Partially Ordered Runs: A Case Study

Download research.microsoft.com

Abstract. We look at some sources of insecurity and diﬃculty 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

Real-time Traffic

ASM 2000 | Case Study | Computational Biology | Lamport’s Bakery Algorithm | Partially Ordered |

claim paper

Related Content

» Partial Order Semantics of Sequence Diagrams for Mobility

» A Case Study in Running a Parallel Branch and Bound Application on the Grid

» Partial Order Reductions Using Compositional Confluence Detection

» An enhanced partial order curve comparison algorithm and its application to analyzing prot...

» Inferring Gene Orders from Gene Maps Using the Breakpoint Distance

» Serial Combination of Rules and Statistics A Case Study in Czech Tagging

» Optimizing Marshalling by RunTime Program Generation

» Edge ranking and searching in partial orders

» The Flow Set with Partial Order

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	ASM
Authors	Yuri Gurevich, Dean Rosenzweig

Comments (0)