7 citations · 9 across the 4 of their papers we have counts for
5 papers
Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0
Pierre Chevalier, Bartlomiej Kaminski, Fraser Hutchison +4
In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove th…
Sets of Stochastic Matrices with Converging Products: Bounds and Complexity
Pierre-Yves Chevalier, Vladimir V. Gusev, Raphaël M. Jungers +1
An SIA matrix is a stochastic matrix whose sequence of powers converges to a rank-one matrix. This convergence is desirable in various applications making use of stochastic matrice…
Tight Bounds for Consensus Systems Convergence
Pierre-Yves Chevalier, Julien M. Hendrickx, Raphaël M. Jungers
We analyze the asymptotic convergence of all infinite products of matrices taken in a given finite set, by looking only at finite or periodic products. It is known that when the ma…
Reachability of Consensus and Synchronizing Automata
Pierre-Yves Chevalier, Julien M. Hendrickx, Raphaël M. Jungers
We consider the problem of determining the existence of a sequence of matrices driving a discrete-time consensus system to consensus. We transform this problem into one of the exis…
Efficient Algorithms for the Consensus Decision Problem
Pierre-Yves Chevalier, Julien M. Hendrickx, Raphaël M. Jungers
We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one swi…