Stochastic and deterministic fault detection for randomized gossip algorithms
type: Item
instance of: scholarly article
title: Stochastic and deterministic fault detection for randomized gossip algorithms
zbMATH Open document ID: 1357.93108
author: Paulo Rosa
author: J. P. Hespanha
author: Carlos Silvestre
author: Daniel A. M. M. Silvestre
published in: Automatica
publication date: 2017-03-28T00:00:00Z
full work available at URL: http://hdl.handle.net/11144/3425
Mathematics Subject Classification ID: 93E25
Mathematics Subject Classification ID: 93B07
Mathematics Subject Classification ID: 93A14
zbMATH DE Number: 6697682
zbMATH Keywords: fault detection
zbMATH Keywords: computer networks
zbMATH Keywords: decentralization
zbMATH Keywords: estimation theory
zbMATH Keywords: randomized methods
zbMATH Keywords: linear parametrically varying (LPV) methodologies
describes a project that uses: FITBOX
MaRDI profile type: Publication
OpenAlex ID: W2580804901
cites work: Guaranteed state estimation by zonotopes
cites work: Q3546603
cites work: Fault tolerant control allocation using unknown input observers
cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem
cites work: Identifiability of linear and nonlinear dynamical systems
cites work: Computation of minimum-time feedback control laws for discrete-time systems with state-control constraints
cites work: Robust Fault Estimation Using Relative Information in Linear Multi-Agent Networks
cites work: Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
cites work: Consensus Computation in Unreliable Networks: A System Theoretic Approach
cites work: Set-valued observers and optimal disturbance rejection
cites work: Fault detection for LPV systems using set-valued observers: a coprime factorization approach
cites work: Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
cites work: Minimal representation of convex polyhedral sets
cites work: On-line fault detection and isolation for linear discrete-time uncertain systems
DOI: 10.1016/J.AUTOMATICA.2016.12.011
Recommended article: A probabilistic characterization of a fault-tolerant gossiping algorithm
Recommended article: Efficient Gossiping by Packets in Networks with Random Faults
Recommended article: The worst case behavior of randomized gossip protocols
Recommended article: Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Recommended article: Meeting the deadline
Recommended article: Fault-tolerant broadcasting and gossiping in communication networks
Recommended article: Tighter time bounds on fault-tolerant broadcasting and gossiping
Recommended article: Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
description: scientific article; zbMATH DE number 6697682