• Corpus ID: 7135739

Verification of Peterson's Algorithm for Leader Election in a Unidirectional Asynchronous Ring Using NuSMV

@article{Ansari2008VerificationOP,
  title={Verification of Peterson's Algorithm for Leader Election in a Unidirectional Asynchronous Ring Using NuSMV},
  author={Amin Ansari},
  journal={ArXiv},
  year={2008},
  volume={abs/0808.0962}
}
  • Amin Ansari
  • Published 6 August 2008
  • Computer Science
  • ArXiv
The finite intrinsic nature of the most distributed algorithms gives us this ability to use model checking tools for verification of this type of algorithms. [] Key Method Although it seems that model checking is not a feasible approach for this problem, I attempt to use several effective limiting assumptions for hiring formal model checking approach without losing the correct functionality of the Peterson's algorithm. These enforced limiting assumptions target the degree of freedom in the model checking…

Figures from this paper

Modeling and Verifying Leader Election Algorithm in CSP

TLDR
This paper studies an election algorithm LE for MANETs and presents a formal model for LE based on process algebra CSP (Communicating Sequential Process), showing the correctness and safety of LE in this respect.

Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Networks

TLDR
Four leader election algorithms used in mobile Ad Hoc Networks are analyzed and recovered nodes inquiring about the current leader and the use of candidates during election are proposed to reduce the overhead of starting a new election session.

Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems

TLDR
This paper investigates Cegar in the context of formal models of network protocols, in this case, the verification of fifo systems, and introduces the introduction of extrapolation-based path invariants for abstraction refinement.

References

SHOWING 1-10 OF 28 REFERENCES

Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394

TLDR
This paper describes the algorithm formally in the I/O automata model of Lynch and Tuttle, and verifies that for an arbitrary tree topology exactly one leader is elected.

Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM

TLDR
Two probabilistic leader election algorithms for anonymous uni- directional rings with FIFO channels, based on an algorithm from Itai and Rodeh, are presented and a manual correctness proof for each algorithm is given.

Simplifying Itai-Rodeh Leader Election for Anonymous Rings

A Timed Verification of the IEEE 1394 Leader Election Protocol

  • J. Romijn
  • Computer Science
    Formal Methods Syst. Des.
  • 2001
TLDR
It is shown that under certain timing restrictions the protocol behaves correctly and the timing parameters in the IEEE 1394 standard documentation obey the restrictions found in this proof.

An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle

Verification of mutual exclusion algorithms with EST

Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified

Formal verification of complex coherence protocols using symbolic state models

TLDR
This paper develops the concepts and notations to verifiy some properties of a directory-based protocol designed for non-FIFO interconnection networks and compares the verification of the protocol with SSM and with the Stanford Mur, a verification tool enumerating system states.

Model Checking

TLDR
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.

Algebraic specification of dynamic leader election protocols in broadcast networks

TLDR
In this paper three leader election protocols of increasing maturity are specified, where an initial leader is present and eventually a fault-tolerant protocol is constructed, where components may crash and revive spontaneously.