• Conference Object  

      Decentralised minimum-time average consensus in digraphs 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2013)
      Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on ...
    • Article  

      Detectability in stochastic discrete event systems 

      Keroglou, C.; Hadjicostis, Christoforos N. (2015)
      A discrete event system possesses the property of detectability if it allows an observer to perfectly estimate the current state of the system after a finite number of observed symbols, i.e., detectability captures the ...
    • Conference Object  

      Distributed strategies for balancing a weighted digraph 

      Hadjicostis, Christoforos N.; Rikos, A. (2012)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Conference Object  

      Distributed weight balancing under integer constraints in the presence of packet drops 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2018)
      A digraph with positive integer weights on its (directed) edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. We develop a distributed ...
    • Conference Object  

      Information dissemination in networks via linear iterative strategies over finite fields 

      Sundaram, S.; Hadjicostis, Christoforos N. (2009)
      Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only ...
    • Article  

      Least-cost transition firing sequence estimation in labeled Petri nets with unobservable transitions 

      Li, L.; Hadjicostis, Christoforos N. (2011)
      This paper proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each ...