Related papers: A Polynomial-Time Algorithm for Solving the Minima…
This paper addresses problems on the robust structural design of complex networks. More precisely, we address the problem of deploying the minimum number of dedicated sensors, i.e., those measuring a single state variable, that ensure the…
Biological processes, including cell differentiation, organism development, and disease progression, can be interpreted as attractors (fixed points or limit cycles) of an underlying networked dynamical system. In this paper, we study the…
We study a state estimation problem for a $2\times 2$ linear hyperbolic system on networks with eigenvalues with opposite signs. The system can be seen as a simplified model for gas flow through gas networks. For this system we construct an…
Boolean control networks (BCNs) are discrete-time dynamical systems with Boolean state-variables and inputs that are interconnected via Boolean functions. BCNs are recently attracting considerable interest as computational models for…
The quantitative understanding and precise control of complex dynamical systems can only be achieved by observing their internal states via measurement and/or estimation. In large-scale dynamical networks, it is often difficult or…
Reconstructing the states of the nodes of a dynamical network is a problem of fundamental importance in the study of neuronal and genetic networks. An underlying related problem is that of observability, i.e., identifying the conditions…
We address the problem of retrieving the full state of a network of R\"ossler systems from the knowledge of the actual state of a limited set of nodes. The selection of the nodes where sensors are placed is carried out in a hierarchical way…
In many problems, agents cooperate locally so that a leader or fusion center can infer the state of every agent from probing the state of only a small number of agents. Versions of this problem arise when a fusion center reconstructs an…
In the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NP-complete problem in general. There have been various attempts…
In this paper, we study the structural state and input observability of continuous-time switched linear time-invariant systems and unknown inputs. First, we provide necessary and sufficient conditions for their structural state and input…
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even more specifically steady states of BNs. Steady states of BNs…
In this article, we revisit the century-old question of the minimal set of observables needed to identify a quantum state: here, we replace the natural coincidences in their spectra by effective ones, induced by an imperfect measurement. We…
Minimal input/output selection is investigated in this paper for each subsystem of a networked system. Some novel sufficient conditions are derived respectively for the controllability and observability of a networked system, as well as…
We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be controlled to drive its dynamics from an initial steady state (or attractor) to a target steady state. Due to the phenomenon…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
Designing sparse sampling strategies is one of the important components in having resilient estimation and control in networked systems as they make network design problems more cost-effective due to their reduced sampling requirements and…
Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from a state s in any attractor As in A to any attractor At in A…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
The state estimation of continuous-time nonlinear systems in which a subset of sensor outputs can be maliciously controlled through injecting a potentially unbounded additive signal is considered in this paper. Analogous to our earlier work…
The literature available on disturbance decoupling (DD) of Boolean control network (BCN) is built on a restrictive notion of what constitutes as disturbance decoupling. The results available on necessary and sufficient conditions are of…