Verification of multiprocess probabilistic protocols

Authors:
Amir Pnueli;Lenore Zuck
Affiliations:
-;-
Venue:
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Year:
1984

Citing 6
Cited 2

Proving Liveness Properties of Concurrent Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
How to cook a temporal proof system for your pet language

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Termination of probabilistic concurrent programs: (extended abstract)

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of Concurrent Programs: Temporal Proof Principles

Logic of Programs, Workshop
On the extremely fair treatment of probabilistic algorithms

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Reasoning about probabilistic algorithms

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Reasoning about probabilistic parallel programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new probabilistic symmetric solution to the n processes mutual exclusion problem is presented. The algorithm is verified formally using the extreme fairness approach to probabilistic verification.