Formal verification of timed properties of randomized distributed algorithms

DOI10.1145/224964.224984zbMath1374.68296OpenAlexW2138035108MaRDI QIDQ5361452

Anna Pogosyants, Roberto Segala

Publication date: 29 September 2017

Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/224964.224984

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (23)

Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms ⋮ Unnamed Item ⋮ SOS specifications for uniformly continuous operators ⋮ Unnamed Item ⋮ Testing probabilistic automata ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Unnamed Item ⋮ Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study ⋮ Randomized Dining Philosophers without Fairness Assumption ⋮ Using probabilistic Kleene algebra pKA for protocol verification ⋮ Causal Unfoldings ⋮ Quantitative Kleene coalgebras ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Unnamed Item ⋮ Termination in Convex Sets of Distributions ⋮ Compositional weak metrics for group key update ⋮ Efficient Coalgebraic Partition Refinement ⋮ Unnamed Item ⋮ Probabilistic π-Calculus and Event Structures

This page was built for publication: Formal verification of timed properties of randomized distributed algorithms