Randomized Dining Philosophers without Fairness Assumption

DOI10.1007/978-0-387-35608-2_15zbMath1448.68091OpenAlexW1553534568MaRDI QIDQ5138505

Claudine Picaronny, Marie Duflot, Laurent Fribourg

Publication date: 4 December 2020

Published in: Foundations of Information Technology in the Era of Network and Mobile Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-35608-2_15

zbMATH Keywords

dining philosophersscheduling mechanismfairness assumption

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Randomized algorithms (68W20)

Related Items

A randomized encoding of the \(\pi\)-calculus with mixed choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Token-based self-stabilizing uniform algorithms
• Verification of multiprocess probabilistic protocols
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Memory space requirements for self-stabilizing leader election protocols
• Proving time bounds for randomized distributed algorithms
• Formal verification of timed properties of randomized distributed algorithms