Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Dwork, M. Herlihy, Serge Plotkin, Orli Waarts (1992)
Time-Lapse Snapshots
N. Lynch, Isaac Saias, R. Segala (1994)
Proving time bounds for randomized distributed algorithmsArXiv, abs/math/9409221
J. Aspnes (1990)
Time-and space-efficient randomized consensus
M. Fischer, N. Lynch, M. Paterson (1985)
Impossibility of distributed consensus with one faulty processJ. ACM, 32
Gabriel Bracha, Ophir Rachman (1991)
Randomized Consensus in Expected O(n²log n) Operations
Moshe Vardi (1985)
Automatic verification of probabilistic concurrent finite state programs26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
C. Derman (1970)
Finite State Markovian Decision Processes
R. Segala (1996)
Modeling and verification of randomized distributed real-time systems
Modularity of probability spaces with respect to parallel composition (Proposition 2.3 used in Propositions 8.2 and 8.3)
H. Hansson (1994)
Time and probability in formal design of distributed systems, 91/27
9 Let H be a probabilistic execution fragment of DAH that starts from a reachable state of DAH , and let be a full cut of H. Then E id
Carroll Morgan, Annabelle McIver, Karen Seidel (1996)
Probabilistic predicate transformersACM Trans. Program. Lang. Syst., 18
Y. Aumann (1997)
Efficient asynchronous consensus with the weak adversary scheduler
N. Lynch, M. Tuttle (1987)
Hierarchical correctness proofs for distributed algorithms
J. Aspnes, M. Herlihy (1990)
Fast Randomized Consensus Using Shared MemoryJ. Algorithms, 11
A. Bianco, L. Alfaro (1995)
Model Checking of Probabalistic and Nondeterministic Systems
N. Lynch, F. Vaandrager (1991)
Forward and Backward Simulations, II: Timing-Based SystemsInf. Comput., 128
A. Pogosyants, R. Segala, N. Lynch (1997)
Veri cation of the Randomized ConsensusAlgorithm of Aspnes and Herlihy : a Case Study ?
J. Aspnes, Orli Waarts (1996)
Randomized Consensus in Expected O(n log² n) Operations Per ProcessorSIAM J. Comput., 25
A. Pogosyants, R. Segala (1995)
Formal verification of timed properties of randomized distributed algorithms
ll-agreer; v i , 3. ll-max-round i = r, 4. valuei = v and roundi = r, then the same conditions hold in s as well
S. Dolev, A. Israeli, S. Moran (1995)
Analyzing Expected Time by Scheduler-Luck GamesIEEE Trans. Software Eng., 21
By Lemma 12.6, for each execution fragment of of CF r , id;r () ip;r () + n
(1963)
Rabin: Probabilistic automata
H. Attiya, D. Dolev, N. Shavit (1989)
Bounded polynomial randomized consensusProceedings of the eighth annual ACM Symposium on Principles of distributed computing
T. Chandra (1996)
Polylog randomized wait-free consensus
N. Lynch, F. Vaandrager (1995)
Forward and Backward Simulations: I. Untimed SystemsInf. Comput., 121
Reenement mappings and related compositionality results (Propositions 2.10, 2.11, and 2.14 used in Theorem 10
(1995)
Formal veriication of timed properties of randomized distributed algorithms 200 R. Segala. Modeling and Veriication of Randomized Distributed R eal-Time Systems
N. Lynch (1994)
Distributed Algorithms, 857
S. Hart, M. Sharir, A. Pnueli (1983)
Termination of Probabilistic Concurrent ProgramACM Trans. Program. Lang. Syst., 5
J. Aspnes (1992)
Time-and Space-eecient Randomized Consensus
Coin lemmas and related results to reduce probability to nondeterminism (Theorems 3.5 and 3.7 used in Propositions 9.11 and 9
Y. Aumann, M. Bender (1996)
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler
W. Feller (1959)
An Introduction to Probability Theory and Its Applications
R. Segala, R. Gawlick, Jørgen Søgaard-Andersen, N. Lynch (1994)
Liveness in Timed and Untimed SystemsInf. Comput., 141
A. Pnueli, L. Zuck (1984)
Verification of multiprocess probabilistic protocolsDistributed Computing, 1
Analysis of computations divided into phases (Proposition 2.5 used in Lemma 12.10). Preservation of expected complexity bounds under parallel composition (Proposition 2.6 used in Lemma 12
L. Lamport (1977)
Concurrent reading and writingCommunications of the ACM, 20
B. Harshbarger (1958)
An Introduction to Probability Theory and its Applications, Volume IAIBS Bulletin, 8
S. Hart, M. Sharir, A. Pnueli (1982)
Termination of probabilistic concurrent programs: (extended abstract)
D. Lehmann, M. Rabin (1981)
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
Sudhanshu Aggarwal, S. Kutten (1993)
Time Optimal Self-Stabilizing Spanning Tree Algorithms
Karl Abrahamson (1988)
On achieving consensus using a shared memory
Distrib. Comput. (2000) 13: 155–186 c Springer-Verlag 2000 Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study 1 2 1 Anna Pogosyants , Roberto Segala , Nancy Lynch Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (e-mail: lynch@theory.lcs.mit.edu) Dipartimento di Scienze dell’Informazione, Universita` di Bologna, Piazza di Porta San Donato 5, 40127 Bologna, Italy (e-mail: segala@cs.unibo.it) Received: February 1999 / Accepted: March 2000 This paper is written in memory of Anna Pogosyants, who died in a car crash in December 1995 while working on this project for her Ph.D. dissertation. Summary. The Probabilistic I/O Automaton model of [31] 1 Introduction is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The With the increasing complexity of distributed algorithms there algorithm guarantees termination within expected polynomial is an increasing need for mathematical tools for analysis. Al- time. The Aspnes-Herlihy algorithm is a rather complex algo- though there are several formalisms and tools for the analysis rithm. Processes move through asuccession of asynchronous of ordinary distributed algorithms, there are not as many pow- rounds, attempting to agree at each round. At each round,
Distributed Computing – Springer Journals
Published: Jul 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.