It follows from the definition of silent self-stabilization, and from the definition of proof-labeling scheme, that if there exists a silent self-stabilizing algorithm using `-bit registers for solving a task T , then there exists a proof-labeling scheme for T using registers of at most ` bits. The first result in this paper is the converse to this statement. We show that if there exists a proo...

Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(n3 + n2 · ch) moves, where n is the number of nodes in the network and ch is the highest initial value of a variable....

this paper proposes an approach for the minimum time swing upof a rotary inverted pendulum. our rotary inverted pendulum is supported bya pivot arm. the pivot arm rotates in a horizontal plane by means of a servomotor. the opposite end of the arm is instrumented with a joint whose axisis along the radial direction of the motor. a pendulum is suspended at thejoint. the task is to design a contro...

This paper is concerned with delay-dependent exponential stability analysis and stabilization for continuous-time T-S fuzzy Markovian jump systems with mode-dependent time-varying delay. By constructing a novel Lyapunov-Krasovskii functional and utilizing some advanced techniques, less conservative conditions are presented to guarantee the closed-loop system is mean-square exponentially stable....

This paper provides necessary and sufficient conditions for exponential stabilization of distributed systems affine in control, evolving in a Banach state space, by means of constant controls. An explicit estimate of the convergence speed is obtained under the given constant control. Various applications are provided.

Introduction: The purpose of this study was to examine the effect of 6 weeks hopping exercises program on time to stabilization and perceived stability in athletes with chronic ankle instability Methods: twenty-eight basketball player with chronic ankle instability (mean ± SD age;22.67±2.88 years, mean ± SD weight; 80.47±8.48 kg, mean ± SD height; 186.82±3.09 cm) were participated in this...

Stabilization is one of the central themes of control theory. It was shown in [1–4] that the class of continuous stationary feedbacks is too restrictive for the purposes of stabilization of nonlinear systems. In other words, in order to design a continuous feedback stabilizer one needs to use functions depending on time and state [6, 8]. To stay with the class of stationary feedbacks one has to...

We present a self-stabilizing algorithm for finding a generalized maximal matching ( -matching) in an arbitrary distributed network. We show that the algorithm converges in moves under an unfair central demon independent of the -values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].

This brief announcement proposes a new model to measure the distributed time complexity of topological self-stabilization. In the field of topological selfstabilization, nodes—e.g., machines in a p2p network—seek to establish a certain network structure in a robust manner (see, e.g., [2] for a distributed algorithm for skip graphs). While several complexity models have been proposed and analyze...