Christoforos N. Hadjicostis

Christoforos N. Hadjicostis

Auto-generated profile, based on publicly available information

Christoforos N. Hadjicostis

University of Cyprus

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 October 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SSShreyas Sundaram
Shreyas Sundaram
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
Given a network of interconnected nodes, each with its own value (such as a measurement, position, vote, or other data), we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of the node values, despite the actions of malicious nodes in the network. Our scheme assumes a broadcast model of communication (where all nodes transmit the same value to all of their neighbors) and utilizes a linear iteration where, at each time-step, each node updates its value to be a weighted average of its own previous value and those of its neighbors. We consider a node to be malicious or faulty if, instead of following the predefined linear strategy, it updates its value arbitrarily at each time-step (perhaps conspiring with other malicious nodes in the process). We show that the topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior. First, when the network contains 2f or fewer vertex-disjoint paths from some node xj to another node xi , we provide an explicit strategy for f malicious nodes to follow in order to prevent node xi from receiving any information about xj's value. Next, if node xi has at least 2f+1 vertex-disjoint paths from every other (non-neighboring) node, we show that xi is guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes is f or less. Furthermore, we show that this function can be calculated after running the linear iteration for a finite number of time-steps (upper bounded by the number of nodes in the network) with almost any set of weights (i.e., for all weights except for a set of measure zero).

24 September 2012 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
BRBrett A. Robbins
Brett A. Robbins
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
ADAlejandro D. Dominguez-Garcia
Alejandro D. Dominguez-Garcia
In this paper, we propose an architecture for voltage regulation in distribution networks that relies on controlling reactive power injections provided by distributed energy resources (DERs). A local controller on each bus of the network monitors the bus voltage and, whenever there is a voltage violation, it uses locally available information to estimate the amount of reactive power that needs to be injected into the bus in order to correct the violation. If the DERs connected to the bus can collectively provide the reactive power estimated by the local controller, they are instructed to do so. Otherwise, the local controller initiates a request for additional reactive power support from other controllers at neighboring buses through a distributed algorithm that relies on a local exchange of information among neighboring controllers. We show that the proposed architecture helps prevent voltage violations and shapes the voltage profile in radial distribution networks, even in the presence of considerable penetration of variable generation and loads. We present several case studies involving 8-, 13-, and 123-bus distribution systems to illustrate the operation of the architecture.

1 January 2007
Verified
Conference Paper
Closed access
ASAnooshiravan Saboori
Anooshiravan Saboori
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
In this paper, we follow a state-based approach to extend the notion of opacity in computer security to discrete event systems. A system is (S, P)-opaque if the evolution of its true state through a set of secret states S remains opaque to an observer who is observing activity in the system through the projection map P. In other words, based on observations through the mapping P, the observer is never certain that the current state of the system is within the set of secret states S. We also introduce the stronger notion of (S,P, K)-opacity which requires opacity to remain true for K observations following the departure of the system's state from the set S. We show that the state-based definition of opacity enables the use of observer constructions for verification purposes. In particular, the verification of (S,P, K)-opacity is accomplished via an observer with K-delay which is constructed to capture state estimates with K-delay. These are the estimates of the state of the system K observations ago and are consistent with all observations (including the last K observations). We also analyze the properties and complexity of the observer with K- delay.

1 January 2018 in Annual Reviews in Control
Verified
Journal Article
Closed access
SLStéphane Lafortune
Stéphane Lafortune
FLFeng Lin
Feng Lin
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis

1 October 2013 in Information Sciences
Verified
Journal Article
Closed access
ASAnooshiravan Saboori
Anooshiravan Saboori
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis

30 July 2013 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
CHChristoforos N. Hadjicostis
Christoforos N. Hadjicostis
Themistoklis CharalambousThemistoklis Charalambous
Themistoklis Charalambous
Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a protocol that overcomes this limitation and, unlike existing consensus protocols in the presence of delays, ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its out-neighbors (i.e., the number of components to which it can send information) and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices. The proposed algorithm is demonstrated via illustrative examples.