Compositional verification of randomized distributed algorithms

DOI10.1007/3-540-49213-5_20MaRDI QIDQ7010063zbMATH OpenFDO

Authors Roberto Segala

Publication date 19 March 2025

Full work available at URL https://doi.org/10.1007/3-540-49213-5_20

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Fast randomized consensus using shared memory
• Formal verification of timed properties of randomized distributed algorithms
• Forward and backward simulations. I. Untimed Systems
• Impossibility of distributed consensus with one faulty process
• Probabilistic automata
• Process Algebra
• Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
• Proving time bounds for randomized distributed algorithms
• Randomized mutual exclusion algorithms revisited
• Reactive, generative, and stratified models of probabilistic processes
• Testing preorders for probabilistic processes
• Verification of multiprocess probabilistic protocols

This page was built for publication: Compositional verification of randomized distributed algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010063)