Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Abstract State Machines at the Cusp of the Millenium Read chapter Read first chapter

2000 | OriginalPaper | Chapter

Partially Ordered Runs: A Case Study

Authors : Yuri Gurevich, Dean Rosenzweig

Published in: Abstract State Machines - Theory and Applications

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

We look at some sources of insecurity and dificulty 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.

previous chapter Towards an ASM Thesis for Unconventional Algorithms
next chapter Investigating Java Concurrency Using Abstract State Machines
Metadata
Title
Partially Ordered Runs: A Case Study
Authors
Yuri Gurevich
Dean Rosenzweig
Copyright Year
2000
Publisher
Springer Berlin Heidelberg
Book
Abstract State Machines - Theory and Applications

Print ISBN: 978-3-540-67959-2

Electronic ISBN: 978-3-540-44518-0

Copyright Year: 2000

DOI
https://doi.org/10.1007/3-540-44518-8_9

Premium Partner

    Image Credits