On the generalized dining philosophers problem

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 81-89

  Herescu, O M ^a   Palamidessi, C ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

DINING PHILOSOPHERS PROBLEM; LEHMANN ALGORITHMS; LOCKOUT-FREEDOM; RABIN ALGORITHMS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0034777358     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/383962.383994     Document Type: Conference Paper

References (11)

1. Hierarchical ordering of sequential processes
2. A distributed abstract data type implemented by a probabilistic communication scheme
3. Probabilistic asynchronous π-calculus
4. Proving time bounds for randomized distributed algorithms
5. A calculus of mobile processes, I and II
6. What is a 'good' encoding of guarded choice?
7. Comparing the expressive power of the synchronous and the asynchronous π-calculus
8. Pict: A programming language based on the pi-calculus
9. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem
10. Modeling and Verification of Randomized Distributed Real-Time Systems
11. Probabilistic simulations for probabilistic processes