Reconstructibility of time-invariant and periodic behavioural systems

In this article, the properties of behavioural reconstructibility and forward-observability for systems over the whole time axis ? are introduced. These properties are characterised in terms of appropriate rank conditions, for the time-invariant case. A comparison is made with the existing results in the behavioural setting as well as in the classical state space framework. In the particular case of a periodic system, it is shown that there exists an equivalence between the reconstructibility of the periodic system and its associated lifted system, which is time-invariant. Furthermore, we prove that, for a classical state space system, state reconstructibility is equivalent to behavioural reconstructibility, regardless of the time varying or time-invariant nature of the system. This allows deriving rank tests for the cases of time-invariant and of periodic systems, rediscovering the already known results for state reconstructibility from an alternative perspective. The obtained results contribute to establishing links between two different settings, thus providing a better insight into the considered systems properties.     

受扰布尔控制网络全局可重构分析与状态估计

受扰布尔控制网络的状态转移,因受未知干扰影响而具有不确定性,这对状态观测器设计带来了困难.本文主要研究了受扰布尔控制网络全局可重构性问题,并在此基础上设计状态观测器.首先,将受扰布尔控制模型转化为多个子系统的切换未知布尔控制网络模型,在此基础上,提出了受扰布尔控制网络的4种不同状态集.其次,基于状态集估计方法,对受扰布尔控制网络状态估计问题进行分析.再次,提出有限时间可重构与全局可重构性概念;同时,根据状态集估计与状态转移分析,分别给出有限时间可重构判定算法与全局可重构性证明的充要条件.最后,给出观测器设计方法,并通过例子证明了本文提出方法的可行性.     

A 2D Invariant System Description for Doubly Periodic 2D Systems

In this paper the well-known 1D lifting isomorphism from periodic systems to invariant ones is extended to 2D case. Controllability and reconstructibility of periodic 2D systems are then defined in terms of invariant associated system. Some examples are presented to illustrate the key feature of periodic controllers weak causality which has no counterpart in the invariant case.     

Reconstructibility analysis and set-observer design for Boolean control networks

This paper deals with the issues of reconstructibility analysis and set-observer design for Boolean control networks (BCNs). A state estimation set is considered to find the state estimation of BCNs, and a reconstructibility judgment matrix (RJM) is obtained by compact vector of state estimation set. Then, a kind of state-reconstructible tree is constructed, and algorithms are also provided to construct it. The state-reconstructible tree can categorize BCNs to be globally reconstructible, locally reconstructible, and unreconstructible. The sufficient and necessary conditions for the reconstructibility of BCNs are given. Meanwhile, the relationship between input–output trajectory and estimated state is derived. Next, with the knowledge of input–output sequence, a set-observer is designed such that the state of BCNs for any global reconstructible BCNs is uniquely determined in a finite time. Some examples are also given to illustrate the effectiveness of the proposed methods.