Self-Stabilizing Algorithms

Tixeuil, Sébastien

doi:10.1201/9781584888215-c26

Cited by 22 publications

(5 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They use an inner tempo, and their inner tempo self-synchronizes among the inner tempo of others. Self-Stabilizing algorithms are part of the distributed system domain [18]. The overall performance is self driven by messages the performers are exchanging breath, look around, noise from the movement of each other.…”

Section: 3mentioning

confidence: 99%

Robots and Choreography: A Contribution to Artificial Sentience Characterization

Gressier‐Soudan¹,

Zebrowski

Lelièvre

2022

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

The research work presented in this paper is at an early stage. While tests for artificial intelligence/consciousness/sentience continue to evolve, there still doesn't seem to be any consensus on what exactly we hope to capture with such tests. In this paper, we explore the possibility of an arts-based performative test for machine sentience. We analyzed a specific choreography, called Chemins à coulisses, through both the language and experience of the choreographer and a spectator, and we offer some additional theoretical lenses through which to tackle this problem, including phenomenology and distributed systems. We offer the beginnings of an approach to creating a performance-based test where the machine doesn't merely imitate steps but engages in a meaningful way with performers and spectators. There may be an under explored area for benchmarking machine sentience that sits at the intersection of phenomenology, choreography, and distributed systems.

show abstract

Section: 3mentioning

confidence: 99%

Robots and Choreography: A Contribution to Artificial Sentience Characterization

Gressier‐Soudan¹,

Zebrowski

Lelièvre

2022

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

show abstract

“…A program is self-stabilizing [10], [11], [26] (or just stabilizing) if, regardless of the initial state, it eventually satisfies its specification. This elegant property enables the program to recover from transient faults or lack of initialization.…”

Section: Introductionmentioning

confidence: 99%

Ideal Stabilization

Nesterenko

Tixeuil²

2011

2011 IEEE International Conference on Advanced Information Networking and Applications

Self Cite

View full text Add to dashboard Cite

International audienceWe define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with arbitrary degree of precision not only the fault-free program behavior but also its recovery operation. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilization to both kinds of specifications. For the first kind, we state the necessary condition for an ideally stabilizing solution. On the basis of this condition we prove that there is no ideally stabilizing solution to the leader election problem. We illustrate the utility of the concept by providing examples of well-known programs and proving them ideally stabilizing. Specifically, we prove ideal stabilization of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol

show abstract

“…A self-stabilizing algorithm consists of mutually exclusive rules that are formed as follows: → , where is a boolean predicate which allows nodes to take an action, and is a series of statements that assign new values to the variables of the nodes and transmit messages if the message passing model is used [ 5 ]. In a self-stabilizing algorithm, each node maintains its variables by holding the precondition.…”

Section: Introductionmentioning

confidence: 99%

“…Temporal scheduling refers to the fairness of schedulers in two main types, fair and unfair (i.e., adversarial). An unfair scheduler does not promise all enabled nodes to make their moves but guarantees the global progress of the system [ 5 ]. In this paper, we use unfair distributed scheduler which subsumes both central and synchronous schedulers, and it is more realistic for WSN applications.…”

Section: Introductionmentioning

confidence: 99%

Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks

Yigit

Dağdeviren

Challenger

2022

Sensors

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most O(n2) step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after O(n) moves in O(n) step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions.

show abstract

Self-Stabilizing Algorithms

Cited by 22 publications

References 65 publications

Robots and Choreography: A Contribution to Artificial Sentience Characterization

Robots and Choreography: A Contribution to Artificial Sentience Characterization

Ideal Stabilization

Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks

Contact Info

Product

Resources

About