相关论文: Sp\'eculation et auto-stabilisation
We present the first self-stabilizing consensus and replicated state machine for asynchronous message passing systems. The scheme does not require that all participants make a certain number of steps prior to reaching a practically infinite…
In 1974 E.W. Dijkstra introduced the seminal concept of self-stabilization that turned out to be one of the main approaches to fault-tolerant computing. We show here how his three solutions can be formalized and reasoned about using the…
By using dissipativity approach, we establish the stability condition for the feedback connection of a deterministic dynamical system $\Sigma$ and a stochastic memoryless map $\Psi$. After that, we extend the result to the class of large…
Just-in-time compilation provides significant performance improvements for programs written in dynamic languages. These benefits come from the ability of the compiler to speculate about likely cases and generate optimized code for these.…
The main objective of the present paper is to construct a new class of space-time discretizations for the stochastic $p$-Stokes system and analyze its stability and convergence properties. We derive regularity results for the approximation…
In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach,…
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The…
Stochastic approximation is a framework unifying many random iterative algorithms occurring in a diverse range of applications. The stability of the process is often difficult to verify in practical applications and the process may even be…
This work establishes a rigorous connection between stability properties of discrete-time algorithms (DTAs) and corresponding continuous-time dynamical systems derived through $ O(s^r) $-resolution ordinary differential equations (ODEs). We…
Given a discounted cost, we study deterministic discrete-time systems whose inputs are generated by policy iteration (PI). We provide novel near-optimality and stability properties, while allowing for non stabilizing initial policies. That…
Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he showed that an arbitrary behavior of the failure detector never violates safety requirements even if it compromises liveness. Consensus implementations…
This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…
High order strong stability preserving (SSP) time discretizations are often needed to ensure the nonlinear (and sometimes non-inner-product) strong stability properties of spatial discretizations specially designed for the solution of…
This paper studies the problem of stabilizing a self-triggered control system with quantized output. Employing a standard observer-based state feedback control law, a self-triggering mechanism that dictates the next sampling time based on…
We consider the Cahn-Hilliard equation with standard double-well potential. We employ a prototypical class of first order in time semi-implicit methods with implicit treatment of the linear dissipation term and explicit extrapolation of the…
This report considers a variable step time discretization algorithm proposed by Dahlquist, Liniger and Nevanlinna and applies the algorithm to the unsteady Stokes/Darcy model. Although long-time forgotten and little explored, the algorithm…
A self-stabilizing is naturally resilient to transients faults (that is, faults of finite duration). Recently, a new class of protocol appears. These protocols are self-stabilizing and are moreover resilient to a limited number of permanent…
We propose and analyze a stabilizing iteration scheme for the algorithmic implementation of model predictive control for linear discrete-time systems. Polytopic input and state constraints are considered and handled by means of so-called…
Classical discrete-time adaptive controllers provide asymptotic stabilization. While the original adaptive controllers did not handle noise or unmodelled dynamics well, redesigned versions were proven to have some tolerance; however,…
Accurate simulations of ice sheet dynamics, mantle convection, lava flow, and other highly viscous free-surface flows involve solving the coupled Stokes/free-surface equations. In this paper, we theoretically analyze the stability and…