Search
Now showing items 1-10 of 149
Laplacian-based matrix design for finite-time average consensus in digraphs
(2018)
In this paper, we consider the problem of assigning time-varying weights on the links of a time-invariant digraph, such that average consensus is reached in a finite number of steps. More specifically, we derive a finite ...
Verification of AA-Diagnosability in Probabilistic Finite Automata is PSPACE-Hard
(2019)
In this paper we consider the complexity of verifying the property of AA-diagnosability in probabilistic finite automata and establish that AA-diagnosability is, in general, a PSPACE-hard problem. In deterministic and ...
Privary Preserving Distributed Average Consensus via Homomorphic Encryption
(2018)
We develop and analyze a distributed nonlinear iterative algorithm that enables the components of a multicomponent system, each with some integer initial value, to asymptotically reach average consensus on their initial ...
Distributed Average Consensus under Quantized Communication via Event- Triggered Mass Summation
(2018)
The goal of distributed average consensus in multiagent systems is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, ...
Finite-Time Distributed Flow Balancing
(2019)
We consider a flow network that is described by a digraph (physical topology), each edge of which can admit a flow within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. The ...
Revelation Time for Initial-State Opacity Measurement in Timed Discrete Event Systems
(2019)
The reliance of many emerging applications on shared cyber-infrastructures has prompted the study of various notions for security and privacy, including notions for deterministic, non-deterministic, and probabilistic ...
When to stop iterating in digraphs of unknown size? An application to finite-time average consensus
(2018)
In multi-agent systems, existing distributed algorithms for finite-time average consensus allow the agents to calculate the exact average in finite time, but typically require the agents to continue the iterative process ...
Exposure Time as a Measure of Opacity in Timed Discrete Event Systems
(2019)
The reliance of many emerging applications on shared cyber-infrastructures has prompted the study of various notions for security and privacy, including notions for deterministic, non-deterministic, and probabilistic ...
Trajectory-observers of timed stochastic discrete event systems: Applications to privacy analysis
(2019)
Various aspects of security and privacy in many application domains can be assessed based on proper analysis of successive measurements that are collected on a given system. This work is devoted to such issues in the context ...
Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays
(2019)
In this paper, we propose a privacy-preserving discrete-time asymptotic average consensus mechanism that allows components of a multi-component system to calculate the exact average of their initial values without revealing ...