Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification
In distributed computing, the leadership election has been used to distributively designate a node as the central controller (leader) of a network of nodes. The complexity of the algorithm arises due to the unawareness of every node of who the current leader is. After running the algorithm, however, a unique node in the network must be elected as the leader and recognized as so by the remaining nodes. In this paper, using CSP, we formalise the leadership election algorithm used by our industrial partner. Its verification is feasible only due to the use of a pattern based strategy that allows the verification to be carried out in a fully local manner. The pattern used here is novel and a further contribution of the paper. A refinement relation together with predicate abstraction is used to describe pattern conformance. The mechanisation of the behavioural conformance is carried out using FDR.
KeywordsLeadership Election Local Analysis Deadlock Freedom
Unable to display preview. Download preview PDF.
- 2.Antonino, P.R.G., Oliveira, M.V.M., Sampaio, A.C.A., Kristensen, K.E., Bryans, J.W.: Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification — Extended version. Technical report, UFPE (2013), http://www.cin.ufpe.br/~prga2/tech/techNFM2014.html
- 6.Formal Systems Ltd. FDR: User Manual and Tutorial, version 2.82 (2005)Google Scholar
- 12.Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall Series in Computer Science. Prentice-Hall (1998)Google Scholar
- 13.Roscoe, A.W., Brookes, S.D.: Deadlock analysis in networks of communicating processes. Distributed Computing (4), 209–230 (1991)Google Scholar