Probabilistic verification of hierarchical leader election protocol in dynamic systems

DOI10.1007/S11704-018-6173-6MaRDI QIDQ1713851zbMATH OpenOpenAlexFDO

Authors Yu Zhou, Nvqi Zhou, Tingting Han, Jiayi Gu, Weigang Wu

Publication date 30 January 2019

Published in Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL https://eprints.bbk.ac.uk/id/eprint/19777/1/FCS_draft.pdf

zbMATH Keywords

distributed computingdynamic systemshierarchical leader election protocolprobabilistic model checking

Mathematics Subject Classification ID

Distributed systems (68M14) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Design and analysis of dynamic leader election protocols in broadcast networks
• scientific article; zbMATH DE number 1696668
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Formal verification of a leader election protocol in process algebra
• Randomized leader election

Cites work

• Assume-guarantee verification for probabilistic systems
• Compositional probabilistic verification through multi-objective model checking
• scientific article; zbMATH DE number 1696668 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Probabilistic model checking for energy-utility analysis

Cited in

(1)

• Design and analysis of dynamic leader election protocols in broadcast networks

This page was built for publication: Probabilistic verification of hierarchical leader election protocol in dynamic systems

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