Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Gu, Jiayi; Zhou, Yu; Wu, Weigang; Chen, Taolue (2015)
Publisher: Springer
Languages: English
Types: Unknown

Classified by OpenAIRE into

arxiv: Computer Science::Multiagent Systems
Leader election protocols have been intensively studied in distributed computing, mostly in the static setting. However, it remains a challenge to design and analyze these protocols in the dynamic setting, due to its high uncertainty, where typical properties include the average steps of electing a leader eventually, the scalability etc. In this paper, we propose a novel model-based approach for analyzing leader election protocols of dynamic systems based on probabilistic model checking. In particular, we employ a leading probabilistic model checker, PRISM, to simulate representative protocol executions. We also relax the assumptions of the original model to cover unreliable channels which requires the introduction of probability to our model. The experiments confirm the feasibility of our approach.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. Yang, Z.W., Wu, W.G., Chen, Y.S., Zhang, J.: Efficient information dissemination in dynamic networks. In: 2013 42nd International Conference on Parallel Processing, pp. 603-610 (2013)
    • 2. Mostefaoui, A., Raynal, M., Travers, C., Patterson, S., Agrawal, D., Abbadi, A.E.: From static distributed systems to dynamic systems. In: Proceedings of the 24th Symposium on Reliable Distributed Systems (SRDS05), IEEE Computer, pp. 109-118 (2005)
    • 3. Li, H., Wu, W., Zhou, Yu.: Hierarchical eventual leader election for dynamic systems. In: Sun, X.-h., Qu, W., et al. (eds.) ICA3PP 2014, Part I. LNCS, vol. 8630, pp. 338-351. Springer, Heidelberg (2014)
    • 4. Chen, S., Billings, S.A.: Neural networks for nonlinear dynamic system modelling and identification. Int. J. Control 56(2), 319-346 (1992)
    • 5. Merritt, M., Taubenfeld, G.: Computing with infinitely many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164-178. Springer, Heidelberg (2000)
    • 6. Guerraoui, R., Hurfin, M., Mostéfaoui, A., Oliveira, R., Raynal, M., Schiper, A.: Consensus in asynchronous distributed systems: a concise guided tour. In: Krakowiak, S., Shrivastava, S.K. (eds.) BROADCAST 1999. LNCS, vol. 1752, pp. 33-47. Springer, Heidelberg (2000)
    • 7. Jha, S.K., Clarke, E.M., Langmead, C.J., Legay, A., Platzer, A., Zuliani, P.: A bayesian approach to model checking biological systems. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 218-234. Springer, Heidelberg (2009)
    • 8. Bradley, A.R.: SAT-based model checking without unrolling. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 70-87. Springer, Heidelberg (2011)
    • 9. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200-204. Springer, Heidelberg (2002)
    • 10. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585-591. Springer, Heidelberg (2011)
    • 11. Zhou, R.F., Hwang, K.: Powertrust: A robust and scalable reputation system for trusted peer-to-peer computing. IEEE Trans. Parallel Distrib. Syst. 18(4), 460-473 (2007)
    • 12. Vaze, R., Heath, R.W.: Transmission capacity of ad-hoc networks with multiple antennas using transmit stream adaptation and interference cancellation. IEEE Trans. Inf. Theory 58(2), 780-792 (2012)
    • 13. Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. ACM Sigact News 2, 36-59 (2004)
    • 14. Gupta, I., van Renesse, R., Birman, K.P.: A probabilistically correct leader election protocol for large groups. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 89-103. Springer, Heidelberg (2000)
    • 15. Mostefaoui, A., Raynal, M., Travers, C.: Crash-resilient time-free eventual leadership. In: Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004, pp.208-217. IEEE (2004)
    • 16. Bordim, J.L., Ito, Y., Nakano, K.: Randomized leader election protocols in noisy radio networks with a single transceiver. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 246-256. Springer, Heidelberg (2006)
    • 17. Larrea, M., Raynal, M.: Specifying and implementing an eventual leader service for dynamic systems. In: 2011 14th International Conference on Network-Based Information Systems (NBiS), pp. 243-249 (2011)
    • 18. Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal modeling and analysis of an audio/video protocol: an industrial case study using uppaal. In: IEEE 18th Real-Time Systems Symposium, 2p (1997)
    • 19. Yue, H., Katoen, J.-P.: Leader election in anonymous radio networks: model checking energy consumption. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds.) ASMTA 2010. LNCS, vol. 6148, pp. 247-261. Springer, Heidelberg (2010)
    • 20. Behrmann, G., David, A., Larsen, K.G.: A tutorial on UPPAAL. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200-236. Springer, Heidelberg (2004)
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article