线性广义时滞系统的状态反馈H∞控制

首先利用线性矩阵不等式(LMI)方法,给出线性广义时滞系统稳定的一个充分条件;然后讨论广义时滞系统的H_∞状态反馈控制,给出控制器存在的充分条件,同时给出控制器的设计.控制器可由矩阵不等式解得。     

广义时滞系统输出反馈无源控制

研究一类广义时滞系统的输出反馈无源控制问题。利用线性矩阵不等式,给出广义时滞系统容许（即正则、稳定、无脉冲）且严格无源的充分条件,在此基础上给出静态输出反馈控制器,保证闭环系统容许且严格无源的充分条件,并且利用矩阵不等式的解设计相应的输出反馈控制器,提供一个算例说明结论的有效性。     

基于矩阵测度的非线性广义时滞系统鲁棒模糊控制

研究T-S模糊广义时滞系统的鲁棒控制问题.不同于传统的寻求公共正定矩阵的方法,基于矩阵测度给出保证系统鲁棒稳定的充分条件,并将此条件进一步转化为线性矩阵不等式.通过求解线性矩阵不等式,得到状态反馈控制器和静态输出反馈控制器.最后通过算例仿真验证了方法的有效性.     

广义系统的时滞依赖静态输出反馈控制

针对一类不确定线性广义时滞系统,给出了静态输出反馈控制器的设计方法.首先基于标称广义时滞系统的稳定条件,以受限线性矩阵不等式形式,给出闭环广义时滞系统正则、无脉冲且渐近稳定的充分条件,同时利用受限矩阵不等式的可行解给出静态输出反馈控制律的一个参数化表示;其次,利用矩阵的正交补,把求受限线性矩阵不等式的可行解问题转化为求严格线性矩阵不等式(LMIs)的可行解;最后应用数值实例说明了所给方法的有效性和正确性.     

不确定时滞双线性广义系统的鲁棒耗散控制

针对带有耗散不确定性的时滞双线性广义系统的鲁棒耗散控制问题,首先将耗散不确定性引入双线性广义系统,利用线性矩阵不等式方法给出系统鲁棒稳定且严格耗散的充分条件;然后利用线性矩阵不等式的解,构造出闭环系统鲁棒耗散的状态反馈控制器;最后通过数值算例验证了所得结论的可行性.     

一类广义时滞系统的极小极大控制

研究一类广义时滞系统的极小极大控制问题,目的是利用构造局部检验函数的方法设计极小极大控制器,使得在最坏的干扰下系统的性能指标上界极小.利用线性矩阵不等式(LM I)给出了广义时滞系统极小极大控制器存在的充分条件,讨论了闭环系统的容许性,并将所得结果推广到含有不确定性的广义时滞系统.最后以数值算例说明了所提出的控制器设计方法的有效性和可行性.     

不确定离散时滞系统经动态输出反馈的时滞依赖保性能控制

考虑了不确定离散时滞系统经动态输出反馈的保性能控制器设计问题．利用离散时滞系统的广义系统表示形式以及有关向量交叉乘积项的界的处理方法，以线性矩阵不等式的形式，给出了一个时滞依赖的保性能输出反馈控制器存在的充分条件．一个数值例子说明了所给方法的有效性．     

一类非线性广义系统的时滞相关耗散控制

针对一类带有非线性摄动的广义时滞系统,研究了时滞相关的鲁棒耗散问题.讨论了此类非线性广义时滞系统的鲁棒耗散性.同时对此类非线性广义时滞系统的二次稳定性进行了研究,分别用线性矩阵不等式（LMI）的方法给出了充分条件,也给出了时滞相关的鲁棒耗散的时滞上界.并且,给出了时滞相关的鲁棒耗散的状态反馈控制器.最后,通过例子验证了定理的可行性.     

不确定广义系统的弹性H∞保性能控制

利用线性矩阵不等式（LMI）方法，研究被控对象与控制器同时存在摄动的H∞保性能控制问题。针对控制器存在加法式摄动情形，以线性矩阵不等式约束条件给出了广义系统弹性H∞保性能的充分条件，并以线性矩阵不等式的可行解给出了相应的控制器设计方法。通过求解具有线性矩阵不等式约束的凸优化问题，给出了弹性H∞最优保性能及最优H∞性能控制器的设计方法。仿真表明了方法的可行性。     

一类含未建模动态的奇异时滞系统的鲁棒镇定问题

利用线性矩阵不等式的方法，研究了一类同时含有参数摄动和未建模动态的线性奇异时滞系统的鲁棒镇定问题.得到了系统可鲁棒镇定的一个充分条件，用线性矩阵不等式的方法，将控制器的求解问题转化为受限线性矩阵不等式的求解问题，并给出了受限线性矩阵不等式的具体解法．最后举例说明了所提出方法的正确性．     

Estimating the plant state from the compensator state

For the systemdot{w} = Swwherew = (xover{z}), this note states and proves necessary and sufficient conditions under which a)zis an estimate of a linear function ofx(i.e.,zestimatesTx), or b) a linear function ofzis an estimate ofx(i.e.,Vzestimatesx). The mappingThas been used previously by the authors to compute the estimator-controller form of a compensator whose state vectorzhad the same dimension as the plant state vectorx.     

Minimal prime state filters and state radicals on state pseudo $${ }$$-algebras

The aim of this paper is the study of some classes of state filters of a state pseudo BL-algebra. The concepts of minimal prime state filter and of state hyperarchimedean pseudo BL-algebra are introduced and a characterization of a state hyperarchimedean pseudo BL-algebra is presented. Also, we define the notion of a state radical of a state filter of a state pseudo BL-algebra, we present a characterization of a state radical and some of its properties. The algebra of state radicals of a state pseudo BL-algebra is studied.     

A state dependent sampling for linear state feedback

In this work, a new state-dependent sampling control enlarges the sampling intervals of state feedback control. We consider the case of linear time invariant systems and guarantee the exponential stability of the system origin for a chosen decay rate. The approach is based on LMIs obtained thanks to sufficient Lyapunov–Razumikhin stability conditions and follows two steps. In the first step, we compute a Lyapunov–Razumikhin function that guarantees exponential stability for all time-varying sampling intervals up to some given bound. This value can be used as a lower-bound of the state-dependent sampling function. In a second step, an off-line computation provides a mapping from the state-space into the set of sampling intervals: the state is divided into a finite number of regions, and to each of these regions is associated an allowable upper-bound of the sampling intervals that will guarantee the global (exponential or asymptotic) stability of the system. The results are based on sufficient conditions obtained using convex polytopes. Therefore, they involve some conservatism with respect to necessary and sufficient conditions. However, at each of the two steps, an optimization on the sampling upper-bounds is proposed. The approach is illustrated with numerical examples from the literature for which the number of actuations is shown to be reduced with respect to the periodic sampling case.     

Quantum state sharing of an arbitrary four-qubit GHZ-type state by using a four-qubit cluster state

We demonstrate that a four-qubit cluster state can be used to realize the deterministic quantum state sharing (QSTS) of an arbitrary four-qubit GHZ-type state among three parties by introducing three ancillary qubits and performing three controlled-NOT operations. In our scheme, any one of the two agents has the ability to reconstruct the original state if he/she collaborates with the other one, whilst individual agent obtains no information.     

On state reduction of incompletely specified finite state machines

State reduction of incompletely specified finite state machines (ISFSMs) is an important task in optimization of sequential circuit design and known as an NP-complete problem. Removal of redundant states reduces the logic, because of this, chip area decreases. In addition, test generation is easier when the sequential circuit is irredundant. In this paper, we present a heuristic for state reduction of ISFSMs. The proposed heuristic is based on a branch-and-bound search technique and identification of sets of compatible states of a given ISFSM specification. We have obtained results as good as the best exact method in the literature but with significantly better run-times.     

基于状态标注的协议状态机逆向方法

协议状态机可以描述一个协议的行为,帮助理解协议的行为逻辑。面向文本类协议,首先利用统计学方法提取表示报文类型的语义关键字;然后利用邻接矩阵描述报文类型之间的时序关系,基于时序关系进行协议状态标注,构建出协议的状态转换图。实验表明,该方法可以正确地描述出报文类型的时序关系,抽象出准确的状态机模型。     

Synthesis of finite state machines for improved state verification

Finite State Machines (FSMs) are used in diverse areas to model hardware and software systems. Verification of FSMs is essential to ensure reliability of systems. To verify that a machine is in an expected state in testing, Unique Input/Output (UIO) sequences are used. The aforementioned testing methodology requires that each state in the FSM has an UIO. However, it is possible for a given machine that few or even none of its states have an UIO sequence. This paper presents a guided heuristic algorithm for synthesizing FSMs such that each state has an UIO sequence. The states of an FSM with identical I/O labels on transitions are grouped in order to identify the states which do not possess UIO sequence. The transitions are then augmented by adding extra output terminals incrementally so that new UIO sequences are created for the states. A greedy approach is used to optimize the number of added outputs. Initially, the transitions which lead to state convergence (i.e., transitions with identical input/output labels taking a set of states to the same next state) and constrained self-loop (i.e., transitions taking a set of states either to itself or leads to state convergence) are identified since a state with only these transitions will never have a UIO sequence. Extra output terminals are added to the FSM which are used only while testing and the augmented output labels make sure that the states are neither convergent nor has constrained self-loop, thereby ensuring UIO sequence. The proposed algorithm, referred to as AUGP, was tested with a large number of FSMs including the Microelectronics Center of North Carolina (MCNC) FSM benchmarks. The augmented state transition table was used as input to a UIO computation algorithm (developed by the same authors [Ahmad I, et al. IEE Proc Comput Digital Tech 2004;151(2):131]) to check the performance of the augmentation algorithm and the tested FSMs were found to possess UIO sequence for all states.     

relationship between Kalman-Bucy state estimation and blended-model state estimation

This correspondence shows the relationship between Kalman-Bucy (K-B) state estimation and blended-model state estimation-a technique used in the aerospace industry. The purpose in presenting this comparison is to aid in the interpretation of the K-B filter when used in a control system and, hopefully, to give the designer a more intuitive "feel" for application of the K-B filter.     

Identification of discrete-time state affine state space models using cumulants

This paper is concerned with the identification of discrete-time, time invariant, state affine state space models driven by an independent identically distributed (IID) random input, and in the presence of process and measurement noise. The identification problem is treated using a cumulant based approach. It is shown that the input-output and input-state crosscumulant equations in the time domain have the form of a linear autonomous system. An algorithmic procedure is then developed, for the computation of the unknown system matrices, based on a standard deterministic linear subspace identification algorithm, provided the input signal has some persistent excitation properties. The special case of Gaussian IID input is also examined. The proposed method is computationally very efficient and its accuracy is illustrated by simulations.     

基于最优状态转移的非因果稳定逆

本文研宄非最小相位系统的精确跟踪问题.理想情况下,非最小相位系统针对参考轨迹的精确跟踪可以通过非因果稳定逆方法实现,但控制输入需从负无穷处开始作用.而在实际情况下应用非因果稳定逆算法时,控制输入通过延拓提前作用的时间是有限的,只能得到近似的跟踪效果.本文提出了一种基于最优状态转移的非因果稳定逆算法,能够在实际情况下实现非最小相位系统对参考轨迹的精确跟踪,放松了稳定逆方法对系统的初始状态和延拓时间的限制,而且在相同跟踪效果的条件下,比近似稳定逆方法的延拓时间更短.对比仿真结果验证了所提方法的性能.