On Automatic Verification of Self-stabilizing Population Protocols
The population protocol model 2 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 8. We report our verification results and discuss the issue of modeling strong fairness constraints in Spin.
Jun Pang Zhengqin Luo Yuxin Deng
University of Luxembourg Computer Science and Communications L-1359 Luxembourg Shanghai Jiao Tong University Department of Computer Science and Engineering 200240 Shanghai, China
国际会议
南京
英文
185-192
2008-06-17（万方平台首次上网日期，不代表论文的发表时间）