Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering
نویسندگان
چکیده
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cover times. The cover time is an indicator of the “time” for an agent to communicate with all the other agents. This indicator is expressed in the number of the pairwise communications (events) and is unknown to agents. In the model, we also assume the existence of a particular agent, the base station. In contrast with the other agents, it has a memory size proportional to the number of agents. We prove that without this kind of assumption, the mutual exclusion problem has no solution. The algorithms in the paper use a phase clock tool. This is a synchronization tool that was recently proposed in the model we use. For our needs, we extend the functionality of this tool to support also phases with unbounded (but finite) duration. This extension seems to be useful also in the future works.
منابع مشابه
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering (Extended Version)
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cov...
متن کاملSelf-Stabilizing Mutual Exclusion on Directed Graphs
This paper investigates the complexity of self-stabilizing mutual exclusion protocols for distributed systems, where processors communicate through shared memory according to a strongly connected directed communication graph. Tchuente's approach of covering a network with one directed cycle is taken as point of departure. This protocol requires O(n 2n) states per processor together with some pr...
متن کاملAutomated Synthesis of Distributed Self-Stabilizing Protocols
In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We extend our approach to synthes...
متن کاملOptimal Self-stabilizing Mutual Exclusion on Synchronous Rings
We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the ring n is unknown, we better the service time by a factor of n (performing the best possible complexity for the stabilization time and the memory consumption). When the memory size is known, we pre...
متن کامل