LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Game Theoretic Analysis of Self-Stabilizing Systems on Arrays

Photo by mluotio83 from unsplash

In 1973 E.W. Dijkstra introduced the notion of self-stabilization in the context of mutual exclusion. Considering the same problem on an array, we present a game theoretic analysis of self-stabilizing… Click to show full abstract

In 1973 E.W. Dijkstra introduced the notion of self-stabilization in the context of mutual exclusion. Considering the same problem on an array, we present a game theoretic analysis of self-stabilizing systems with three- ‎or four-state machines. We give a formalized definition of the problem as a game where each player’s strategy represents the state of its corresponding machine. For the three-state case, we prove the impossibility of any infinite self-stabilizing systems on an array. For the four-state case we consider two algorithms. For Ghosh’s solution [1] we prove the upper bound of (n – 1)(n – 3) steps and that this bound is tight. Also we present another four-state self-stabilizing system, ‎and prove that at most n2 – 5n + 7 steps are required for the system to reach self-stabilization.

Keywords: self stabilizing; stabilizing systems; game theoretic; state; self

Journal Title: Journal of Computer and Systems Sciences International
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.