Pages that link to "Item:Q5361423"
From MaRDI portal
The following pages link to Proving time bounds for randomized distributed algorithms (Q5361423):
Displayed 7 items.
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- Randomized Dining Philosophers without Fairness Assumption (Q5138505) (← links)
- Testing probabilistic automata (Q6104379) (← links)