Communicating sequential processes
Communications of the ACM
Distributed processes: a concurrent programming concept
Communications of the ACM
Operating system principles
The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Improved algorithms for distributed resource allocation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
IEEE Transactions on Software Engineering
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Reasoning about probabilistic algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Efficient fault tolerant algorithms for resource allocation in distributed systems
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A tradeoff between safety and liveness for randomized coordinated attack protocols
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient asynchronous distributed symmetry breaking
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling with conflicts, and applications to traffic signal control
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Concurrent programming for the masses (invited address)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Events in Haskell, and how to implement them
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Verification of randomized distributed algorithms
Lectures on formal methods and performance analysis
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Termination of probabilistic concurrent programs: (extended abstract)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unbounded speed variability in distributed communication systems
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Coin Lemmas with Random Variables
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Automatic Verification of Probabilistic Free Choice
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Distributed algorithms for synchronizing interprocess communication within real time
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Real time resource allocation in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
N-processors graphs distributively achieve perfect matchings in O(log2N) beats
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Verification of multiprocess probabilistic protocols
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
Distributed Computing
ProbMela and verification of Markov decision processes
ACM SIGMETRICS Performance Evaluation Review
A modular drinking philosophers algorithm
Distributed Computing
Naming symmetric processes using shared variables
Distributed Computing
Probabilistic Configuration Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Generating Compact MTBDD-Representations from Probmela Specifications
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Parameterized verification by probabilistic abstraction
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
All k-bounded policies are equivalent for self-stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing distributed algorithm for resolving conflicts
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
The buck stops here: order, chance, and coordination in distributed control
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Synthesis for probabilistic environments
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Importance splitting for statistical model checking rare properties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Knowledge based transactional behavior
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
It is shown that distributed systems of probabilistic processors are essentially more powerful than distributed systems of deterministic processors, i.e., there are certain useful behaviors that can be realized only by the former. This is demonstrated on the dining philosophers problem. It is shown that, under certain natural hypotheses, there is no way the philosophers can be programmed (in a deterministic fashion) so as to guarantee the absence of deadlock (general starvation). On the other hand, if the philosophers are given some freedom of choice one may program them to guarantee that every hungry philosopher will eat (with probability one) under any circumstances (even an adversary scheduling). The solution proposed here is fully distributed and does not involve any central memory or any process with which every philosopher can communicate.