A. Pogosyants, R. Segala, and N. A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155--186, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Self-stabilizing Neighborhood Unique Naming under Unfair.. - Gradinariu, Johnen (2001) (2 citations) (Correct)
....hold : The probability of the set of st computations, that reach a configuration satisfying is 1. Formally, #st, P st (EL) 1. A configuration satisfies i# it is a deadlock. Convergence of Probabilistic Stabilizing Systems. Building on previous works on probabilistic automata (see [11, 15, 10, 8], 1] presented a framework for proving self stabilization of probabilistic distributed systems. In the following we recall a key property of the system called local convergence and denoted by LC. Let DS be a distributed system. Let st be a strategy of DS, PR1 and PR2 be two closed predicates on ....
Pogosyants, A., Segala, R., and Lynch N.: Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. In Distributed Computing, 13 (2000), 155-186
Self-stabilizing Neighborhood Unique Naming under Unfair.. - Gradinariu, Johnen (2001) (2 citations) (Correct)
....: ffl The probability of the set of st computations, that reach a configuration satisfying L is 1. Formally, 8st; P st (EL) 1. ffl A configuration satisfies L iff it is a deadlock. Convergence of Probabilistic Stabilizing Systems. Building on previous works on probabilistic automata (see [11, 15, 10, 8], 1] presented a framework for proving self stabilization of probabilistic distributed systems. In the following we recall a key property of the system called local convergence and denoted by LC. Let DS be a distributed system. Let st be a strategy of DS, PR1 and PR2 be two closed predicates on ....
Pogosyants, A., Segala, R., and Lynch N.: Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. In Distributed Computing, 13 (2000), 155-186
On the Importance of Having an Identity or, is.. - Buhrmann.. (Correct)
.... protocol for consensus in the symmetric model (which can withstand the strong adversary) is obtained by combining several known ideas and protocols, in particular those in [3] and [6] When compared to the protocol in [3] it is, we believe, simpler, and its correctness is easier to establish (see [14]) Moreover, it works in the less powerful symmetric model and can deal with the strong adversary, whereas the protocol in [6] works only against the intermediate adversary. From the technical point of view, our second result is essentially contained in [11] to which we refer for other ....
A. Pogosyants, R. Segala and Nancy Lynch, Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study, MIT Technical Memo number MIT/LCS/TM-555, June 1997. 12
Memory Space Requirements for Self-Stabilizing Leader.. - Beauquier.. (1999) (7 citations) (Correct)
....is not so simple, because this model has to consider the daemon as an adversary, and clearly separate what is not deterministic (the daemon) and what is randomized (the protocol) There is no place here to develop such a model; that is left to the complete paper. Some useful elements appear in [22] and [5] Let us just summarize here what is needed for proving such an impossibility result: for an infinite sequence of allowed choices of the daemon, the subset of incorrect computations (according to the specification of the problem) has a strictly positive measure. First, we need some ....
A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. In WDAG97 Distributed Algorithms 11th International Workshop Proceedings, Springer-Verlag LNCS:1320, pages 22--36, 1997.
On the Space Complexity of Randomized Synchronization - Fich, al. (1993) (5 citations) (Correct)
....at any point in an execution is given by the state of all processes and the value of all objects. A process may become faulty at a given point in an execution, in which case it performs no subsequent operations. A more formal description of our model can be given in terms of I O automata [27, 28, 29, 31]. The randomized asynchronous computation model, which includes coin flips, is described in [9] A formal definition of linearizability can be found in [21] An operation of an object type is said to be trivial if applying the operation to any object of the type always leaves the value of the ....
A. Pogosyants, R. Segala, and N. Lynch, "Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study," Unpublished manuscript, MIT, 1996.
Switched Probabilistic I/O Automata - Ling Cheung Nancy Self-citation (Segala Lynch) (Correct)
No context found.
A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155--186, 2000.
Compositionality for Probabilistic Automata - Nancy Lynch Roberto (2003) Self-citation (Segala Lynch) (Correct)
No context found.
A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155--186, 2000.
Verification of the Randomized Consensus - Algorithm Of Aspnes Self-citation (Pogosyants Segala Lynch) (Correct)
No context found.
A. Pogosyants, R. Segala, and N. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Technical Memo MIT/LCS/TM-555, MIT Laboratory for Computer Science, 1997.
Compositionality for Probabilistic Automata - Lynch, Segala, Vaandrager (2003) Self-citation (Segala Lynch) (Correct)
No context found.
A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155--186, 2000.
Robust Emulation of Shared Memory Using Dynamic.. - Lynch, Shvartsman (1997) (19 citations) Self-citation (Lynch) (Correct)
.... ( 1 ) lex ( 2 ) or if (b) 1 is a write, 2 is a read, and ( 1 ) lex ( 2 ) In showing the correctness of ARQ , we use a succinct and effective way of expressing the eventuality of certain outcomes based on the current knowledge. The proof uses a fill notion (also used in [20]) which we use to predict the acknowledgment vector for a current invocation. This notion can be used to great advantage in stating our invariants and in reducing the size of their proofs. Our fill notion produces a virtual acknowledgment from each processor based on taking the actual ....
A. Pogosyants, R. Segala and N. Lynch, "Verification of the Randomized Consensus Algorithm of Aspens and Herlihy: a Case Study", manuscript, 1997.
Compositional Reasoning for Probabilistic Finite-State.. - Deng, Palamidessi, Pang (Correct)
No context found.
A. Pogosyants, R. Segala, and N. A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155--186, 2000.
An Algebraic Approach to Fault Tolerant Distributed Computing - Fuzzati (2004) (Correct)
No context found.
A. Pogosyants, R. Segala and N. Lynch. Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study. Distributed Computing, 13(3):155--186, 2000.
Modeling Consensus in a Process Calculus - Uwe Nestmann Rachele (2003) (1 citation) (Correct)
No context found.
A. Pogosyants, R. Segala and N. Lynch. Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study. Distributed Computing, 13(3):155--186, 2000.
Self-stabilizing Neighborhood Unique Naming under Unfair.. - Gradinariu, Johnen (2001) (2 citations) (Correct)
No context found.
Pogosyants, A., Segala, R., and Lynch N.: Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. In Distributed Computing, 13 (2000), 155-186
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC