Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
Recent Submissions
-
Article
A Durable, Screen-Printed Sensor for In Situ and Real-Time Monitoring of Concrete's Electrical Resistivity Suitable for Smart Buildings/Cities and IoT
(2018)This article shows initial experimental results on the utilization of a durable, low-cost, screen-printed resistivity sensor in concrete for real-time measurements, with the aim of correlating concrete's electrical resistivity ...
-
Article
Distributed Flow Network Balancing With Minimal Effort
(2019)The flow network balancing problem, i.e., the problem of balancing the incoming and outgoing flows for each vertex of a directed graph, has been widely investigated with several distributed solutions being proposed in ...
-
Article
Distributed Balancing With Constrained Integer Weights
(2019)We consider the distributed integer-weight-balancing problem in networks of nodes that are interconnected via directed edges, each able to admit a positive integer weight (or flow) within a certain interval, captured by ...
-
Article
Distributed Calculation of Edge-Disjoint Spanning Trees for Robustifying Distributed Algorithms Against Man-in-the-Middle Attacks
(2018)In this paper, we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Man-in-the-Middle (MITM) attacks that aim at steering the result of the algorithm ...
-
Article
Probabilistic system opacity in discrete event systems
(2018)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system’s operation) be kept secret (opaque) to ...
-
Conference Object
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 ...
-
Conference Object
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 ...
-
Conference Object
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 ...
-
Conference Object
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 ...
-
Conference Object
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 ...
-
Conference Object
Robust Linear Quadratic Regulator for Markov Jump Systems
(2019)Tzortzis, I. and Charalambous, C. D. and c, C. N.
-
Conference Object
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 ...
-
Conference Object
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 ...
-
Article
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 ...
-
Conference Object
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 ...
-
Article
Compositional Visible Bisimulation Abstraction Applied to Opacity Verification ⁎⁎This work was carried out within the project SyTec - Systematic Testing of Cyber-Physical Systems, a Swedish Science Foundation grant for strong research environment. The support is gratefully acknowledged.
(2018)In this paper, an alternative equivalence based definition of bisimulation is proposed, called visible bisimulation equivalence. It includes both state and transition labels and therefore unifies stuttering and branching ...
-
Conference Object
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, ...
-
Conference Object
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 ...
-
Article
On the history of diagnosability and opacity in discrete event systems
(2018)This paper presents historical remarks on key projects and papers that led to the development of a theory of event diagnosis for discrete event systems modeled by finite-state automata or Petri nets in the 1990s. The goal ...
-
Article
Trajectory Planning under Current-State Opacity Constraints
(2018)Privacy and security guarantee against curious observers or malicious actors has recently emerged as a critical aspect for maintaining, protecting, and securing complex automated systems that are implemented over shared ...
RSS 1.0