English
Related papers

Related papers: Sp\'eculation et auto-stabilisation

200 papers

A self-stabilizing protocol has the capacity to recover a legitimate behavior whatever is its initial state. The majority of works in self-stabilization assume a shared memory model or a communication using reliable and FIFO channels. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-04-21 Shlomi Dolev , Swan Dubois , Maria Potop-Butucaru , Sébastien Tixeuil

An optimal control for a dynamical system optimizes a certain objective function. Here we consider the construction of an optimal control for a stochastic dynamical system with a random structure, Poisson perturbations and random jumps,…

Optimization and Control · Mathematics 2023-01-24 Taras Lukashiv , Yuliia Litvinchuk , Igor Malyk , Anna Golebiewska , Petr V. Nazarov

Topological self-stabilization describes the ability of a distributed system to let the nodes themselves establish a meaningful overlay network. Independent from the initial network topology, the system converges to the desired topology via…

Logic in Computer Science · Computer Science 2016-04-15 Christina Rickmann

Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-23 Stéphane Devismes , Colette Johnen

Self-oscillations are the result of an efficient mechanism generating periodic motion from a constant power source. In quantum devices, these oscillations may arise due to the interaction between single electron dynamics and mechanical…

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-09-29 Stéphane Devismes , Sébastien Tixeuil , Masafumi Yamashita

We study the design of one-to-one matching mechanisms that are strategy-proof for both sides and as stable as possible. Motivated by the impossibility result of Roth (1982), we formulate the mechanism design problem as a linear program that…

Theoretical Economics · Economics 2026-02-04 Tohya Sugano

We consider the leader election problem in population protocol models. In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom.…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-21 Yuichi Sudo , Ryota Eguchi , Taisuke Izumi , Toshimitsu Masuzawa

We consider the stabilization of an unstable discrete-time linear system that is observed over a channel corrupted by continuous multiplicative noise. Our main result shows that if the system growth is large enough, then the system cannot…

Systems and Control · Computer Science 2016-12-22 Jian Ding , Yuval Peres , Gireeja Ranade , Alex Zhai

A self-stabilizing protocol tolerates by definition transient faults (faults of finite duration). Recently, a new class of self-stabilizing protocols that are able to tolerate a given number of permanent faults. In this paper, we focus on…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-04-23 Swan Dubois , Sébastien Tixeuil , Nini Zhu

Building upon findings in computational model of handwriting learning and execution, we introduce the concept of stability to explain the difference between the actual movements performed during multiple execution of the subject's…

Computer Vision and Pattern Recognition · Computer Science 2024-05-21 Antonio Parziale , Moises Diaz , Miguel A. Ferrer , Angelo Marcelli

Constrained quadratic programs and Euclidean projections are ubiquitous in engineering, arising in machine learning, estimation, control, and signal processing. Dykstra's algorithm is an iterative scheme for computing the Euclidean…

Optimization and Control · Mathematics 2025-11-25 Claudio Vestini , Idris Kempf

We extend slow manifolds near a transcritical singularity in a fast-slow system given by the explicit Euler discretization of the corresponding continuous-time normal form. The analysis uses the blow-up method and direct trajectory-based…

Dynamical Systems · Mathematics 2019-07-16 Maximilian Engel , Christian Kuehn

Eigenstate phases such as the discrete time crystal exhibit an inherent instability upon the coupling to an environment, which restores equipartition of energy and therefore acts against the protecting nonergodicity. Here, we demonstrate…

Quantum Physics · Physics 2019-02-19 Leon Droenner , Regina Finsterhölzl , Markus Heyl , Alexander Carmele

When evolving in time the solution of a hyperbolic partial differential equation, it is often desirable to use high order strong stability preserving (SSP) time discretizations. These time discretizations preserve the monotonicity…

Numerical Analysis · Mathematics 2017-08-02 Sidafa Conde , Sigal Gottlieb , Zachary J. Grant , John N. Shadid

Dynamics in a distributed system are self-stabilizing if they are guaranteed to reach a stable state regardless of how the system is initialized. Game dynamics are uncoupled if each player's behavior is independent of the other players'…

Computer Science and Game Theory · Computer Science 2014-05-07 Aaron D. Jaggard , Neil Lutz , Michael Schapira , Rebecca N. Wright

In this work we propose a nonlinear stabilization technique for convection-diffusion-reaction and pure transport problems discretized with space-time isogeometric analysis. The stabilization is based on a graph-theoretic artificial…

Numerical Analysis · Computer Science 2019-11-18 Jesús Bonilla , Santiago Badia

In this paper, we concentrate on the exponential stabilization of stochastic nonlinear systems. Different from the single event-triggering mechanism in traditional deterministic/stochastic control systems, based on two stopping time…

Dynamical Systems · Mathematics 2023-06-01 Xuetao Yang , Quanxin Zhu

The first self-stabilizing algorithm [Dij73] assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Shlomi Dolev , Ted Herman

We propose a quantitative direct method to prove the local stability of a stationary solution for a rough differential equation and its regular discretization scheme. Using Doss-Sussmann technique and stopping time analysis, we provide…

Dynamical Systems · Mathematics 2025-09-24 Luu Hoang Duc , Phan Thanh Hong , Nguyen Dinh Cong