Coin Lemmas with Random Variables

Authors:
Katia Folegati;Roberto Segala
Affiliations:
-;-
Venue:
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Year:
2001

Citing 9
Cited 1

Bisimulation through probabilistic testing (preliminary report)

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Formal verification of timed properties of randomized distributed algorithms

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Time and Probability in Formal Design of Distributed Systems

Time and Probability in Formal Design of Distributed Systems
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite State Markovian Decision Processes

Finite State Markovian Decision Processes
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Distributed Computing

Verifying Randomized Byzantine Agreement

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coin lemmas are a tool for decoupling probabilistic and nondeterministic arguments in the analysis of concurrent probabilistic systems. They have revealed to be fundamental in the analysis of randomized distributed algorithms, where the interplay between probability and nondeterminism has proved to be subtle and difficult to handle. We reformulate coin lemmas in terms of random variables obtaining a new collection of coin lemmas that is independent of the underlying computational model and of more general applicability to the study of concurrent nondeterministic probabilistic systems.