Skip to main content
Springer Nature Link
Log in

On automatic verification of self-stabilizing population protocols

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

The population protocol model has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with each other to carry out a computation. The interactions of nodes are subject to a fairness constraint. One essential property of population protocols is that all nodes must eventually converge to the correct output value (or configuration). In this paper, we aim to automatically verify self-stabilizing population protocols for leader election and token circulation in the Spin model checker. We report our verification results and discuss the issue of modeling strong fairness constraints in Spin.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Fuzzati R. Merro M, Nestmann U. Distributed consensus, revisited. Acta Informatica, 2007, 44(6): 377–425

    Article  MATH  MathSciNet  Google Scholar 

  2. Chandra T D. Toueg S. Unreliable failure detector for reliable distributed systems. Journal of the ACM, 1996, 43(2): 225–267

    Article  MATH  MathSciNet  Google Scholar 

  3. Holzmann G J. The model checker Spin. IEEE Transactions on Software Engineering, 1997, 23(5): 279–295

    Article  MathSciNet  Google Scholar 

  4. Aspnes J. Ruppert E. An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science, Distributed Computing Column, 2007, 93: 98–117

    MathSciNet  Google Scholar 

  5. Attie P C. Francez N, Grumberg O. Fairness and hyperfairness in multi-party interactions. Distributed Computing, 1993, 6: 245–254

    Article  MATH  Google Scholar 

  6. Lamport L. Fairness and hyperfairness. Distributed Computing, 2000, 13(4): 239–245

    Article  Google Scholar 

  7. Völzer H. Varacca D, Kindler E. Defining fairness. In: Proceedings of the 14th Conference on Concurrency Theory. Berlin: Springer, 2005, 3653: 458–472

    Google Scholar 

  8. Völzer H. On conspiracies and hyperfairness in distributed computing. In: Proceedings of the 19th Conference on Distributed Computing. Berlin: Springer, 2005, 3724: 33–47

    Google Scholar 

  9. Corradini F. Di Berardini M, Vogler W. Checking a mutex algorithm in a process algebra with fairness. In: Proceedings of the 15th Conference on Concurrency Theory. Berlin: Springer, 2006, 4137: 142–157

    Google Scholar 

  10. Fischer M J. Jiang H. Self-stabilizing leader election in networks of finite-state anonymous agents. In: Proceedings of the 10th Conference on Principles of Distributed Systems. Berlin: Springer, 2006, 4305: 395–409

    Google Scholar 

  11. Angluin D. Aspnes J, Fischer M J, Jiang H. Selfstabilizing population protocols. In: Proceedings of the 9th Conference on Principles of Distributed Systems. Berlin: Springer, 2005, 3974: 103–117

    Google Scholar 

  12. Holzmann G J. On-the-fly, LTL model checking with spin. http://spinroot.com

  13. Holzmann G J. The spin model checker: Primer and reference manual. Addison-Wesley, 2003

  14. Dijkstra E W. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 1974, 17(11): 643–644

    Article  MATH  Google Scholar 

  15. Luo Z Q. Pang J, Deng Y X. Promela source codes of selfstabilizing population protocols. http://basics.sjtu.edu.cn/,zhengqin/population

  16. Jiang H. Distributed systems of simple interacting agents. Yale University, 2007

  17. Hammer M. Knapp A, Merz S. Truly on-the-fly LTL model checking. In: Proceedings of the 11th Conference on Tools and Algorithms for the Construction and Analysis of Systems. Berlin: Springer, 2005, 3440: 191–205

    Google Scholar 

  18. Fokkink W J. Hoepman J H, Pang J. A note on K-state selfstabilization in a ring with K=N. Nordic Journal of Computing, 2005, 12(1): 18–26

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Communications, Université du Luxembourg, Luxembourg, 1359, Luxembourg

    Jun Pang

  2. State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, 210093, China

    Jun Pang

  3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, 200240, China

    Zhengqin Luo & Yuxin Deng

Authors
  1. Jun Pang
    View author publications

    Search author on:PubMed Google Scholar

  2. Zhengqin Luo
    View author publications

    Search author on:PubMed Google Scholar

  3. Yuxin Deng
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Jun Pang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pang, J., Luo, Z. & Deng, Y. On automatic verification of self-stabilizing population protocols. Front. Comput. Sci. China 2, 357–367 (2008). https://doi.org/10.1007/s11704-008-0040-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-008-0040-9

Keywords