Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and Space-Efficient Randomized Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast randomized consensus using shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient asynchronous consensus with the weak adversary scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog randomized wait-free consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Lapse Snapshots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liveness in timed and untimed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Probabilistic Concurrent Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent reading and writing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving time bounds for randomized distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward and backward simulations. I. Untimed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of multiprocess probabilistic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of timed properties of randomized distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank

Latest revision as of 02:43, 24 July 2024

scientific article; zbMATH DE number 7281371
Language Label Description Also known as
English
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
scientific article; zbMATH DE number 7281371

    Statements

    Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2020
    0 references
    randomized consensus
    0 references
    probabilistic automata
    0 references
    verification
    0 references
    performance analysis
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references