Search
Now showing items 1-10 of 263
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2019)
We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
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 ...
Revised Test for Stochastic Diagnosability of Discrete-Event Systems
(2018)
This paper provides revisions to the algorithms presented by Chen et al., 2013 for testing diagnosability of stochastic discrete-event systems. Additional new contributions include PSPACE-hardness of verifying strong ...
Distributed Integer Weight Balancing in the Presence of Time Delays in Directed Graphs
(2018)
A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges is equal to the sum of the weights of the outgoing edges. Weight-balanced digraphs play an ...
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 Cycle Detection and Removal
(2018)
In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph
Distributed Fault Diagnosis in Discrete Event Systems via Set Intersection Refinements
(2018)
We extend and verify diagnosability for a class of set intersection refinement strategies, which can be used for distributed state estimation and fault diagnosis in nondeterministic finite automata that are observed at ...
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 ...