极小-极大-加系统(F,G,H)的能达能观性

在数字电路中"两个时间信号通过逻辑电路的"与"门相当于极大运算,"或"门相当于极小运算.因此,极小-极大-加系统可用于数字电路的时间分析.对于非线性极强的极小-极大-加系统(F,G,H)引入了分别能达和上限能观的概念.利用图论的方法给出了极小-极大-加系统(F,G,H)的状态变量x_t为分别能达分量的充要条件,同时,还得到了x_t为上限能观分量的充要条件.

     

非线性DEDS的标准结构

非线性DEDS是指由极大极小函数描述的系统, 常见于计算机科学、控制论、运筹学等领域, 考虑非自治非线性DEDS的结构问题, 通过引入白色图和凝白色图, 得到了系统能达和能观的两个充要条件以及系统的标准结构, 同时还给出了它们的矩阵表示.     

极大极小系统的周期时间配置域

通信网络、计算机网络、工业制造等领域的许多问题可以由极大极小系统模型描述．周期时间是极大极小系统的周期行为指标．引入极大极小系统关于状态反馈的周期时间配置域概念．证明周期时间配置域局部无界性等价于系统局部能达性,并指出配置域的无界性与系统的能稳性的关联．同时证明周期时间配置域是闭的和连通的．     

极小极大加系统(F,G,H)的输出反馈镇定

研究了一般化非自治非线性极小极大加系统的输出反馈镇定问题.首先,提出了闭环系统单极大射影系统表达式.其次,研究指出闭环单极大射影子系统存在严格的颜色匹配关系.接着,针对颜色匹配的复杂情况,提出新的着色图构造.以往对闭环单极大射影子系统中出现的新增圈研究,仅涉及含有一条反馈弧的圈,本文指出新增圈中可能包含由多条反馈弧构成的圈.最后,根据新着色图和新增罔特点得到了系统输出反馈镇定的一个充分条件.     

部分能观的DES监控器设计

离散事件监控理论是目前研究DEDS的一个主要分支.本文研究了在事件部分能控、能 观情况下监控器存在的一个充要条件和设计方法,并用实例说明了该方法的有效性.     

一类离散非方广义系统的能控性与能观性

本文针对一类离散非方广义系统模型,引入乘子得到其逆等矩阵模型,并进一步判断该类系统模型的完全能控性、能达能控性、完全能观性、能达能观性以及之间的对偶关系。     

基于矩阵方法的有界Petri网系统的能观性分析

Petri网和有限自动机是离散事件动态系统的两类主要研究内容.而Petri网系统的能观性分析与判别是基于Petri网的实际系统设计、优化、监测及控制的重要基础.以往关于Petri网能观测性的研究缺乏定量化的充要判别条件.本文利用代数矩阵方法研究了带有输出的有界Petri网系统的能观性问题.首先,基于矩阵的半张量积,将带有输出的有界Petri网系统的动态行为以线性方程组的形式建立了数学模型.然后,针对初始标识和当前标识,介绍了两种能观性定义.最后,基于矩阵运算建立了关于有界Petri网系统能观性的几个充分必要条件,并给出严格证明.数值算例验证了理论结果.本文提出的方法实现了有界Petri网系统能观性的矩阵运算,易于计算机实现.     

一般模糊极大-极小神经网络的研究与应用

分析一般模糊极大-极小神经网络的基本原理,阐述模糊计算方法在分类中的准确性和高效性。将一般模糊极大-极小神经网络应用于企业资信评估中,实现模糊区间的输入,缩小企业评估指标定量化中的误差范围。资信评估结果表明,该算法能快速、有效地对企业进行分类,为资信评估提供了解决方案。     

非线性DEDS 能达性*

本文提出了非线性DEDS 的两种能达性的定义与判据,比较了两种能达性,也研究了对偶系统的能达性.     

离散事件动态系统的能观性

研究离散事件动态系统的能观性与对偶原理,用极大代数上方程唯一解的引理得到了完全能观性的新判据,由此给出了著名的对偶原理;提出能观维数的新概念,得到了维数对偶原理:并分析了完全能观状态集的结构。     

How non-zero initial conditions affect the minimality of linear discrete-time systems

From the state-space approach to linear systems, promoted by Kalman, we learned that minimality is equivalent with reachability together with observability. Our past research on optimal reduced-order LQG controller synthesis revealed that if the initial conditions are non-zero, minimality is no longer equivalent with reachability together with observability. In the behavioural approach to linear systems promoted by Willems, that consider systems as exclusion laws, minimality is equivalent with observability. This article describes and explains in detail these apparently fundamental differences. Out of the discussion, the system properties weak reachability or excitability, and the dual property weak observability emerge. Weak reachability is weaker than reachability and becomes identical only if the initial conditions are empty or zero. Weak reachability together with observability is equivalent with minimality. Taking the behavioural systems point of view, minimality becomes equivalent with observability when the linear system is time invariant. This article also reveals the precise influence of a possibly stochastic initial state on the dimension of a minimal realisation. The issues raised in this article become especially apparent if linear time-varying systems (controllers) with time-varying dimensions are considered. Systems with time-varying dimensions play a major role in the realisation theory of computer algorithms. Moreover, they provide minimal realisations with smaller dimensions. Therefore, the results of this article are of practical importance for the minimal realisation of discrete-time (digital) controllers and computer algorithms with non-zero initial conditions. Theoretically, the results of this article generalise the minimality property to linear systems with time-varying dimensions and non-zero initial conditions.     

On the reachability in any fixed time for positive continuous-time linear systems

This paper deals with the reachability of continuous-time linear positive systems. The reachability of such systems, which we will call here the strong reachability, amounts to the possibility of steering the state in any fixed time to any point of the positive orthant by using nonnegative control functions. The main result of this paper essentially says that the only strongly reachable positive systems are those made of decoupled scalar subsystems. Moreover, the strongly reachable set is also characterized.     

Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems

In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of the reachability problem in a stochastic control framework reveals that it is amenable to two complementary interpretations, leading to dual algorithms for reachability computations. In particular, the set of initial conditions providing a certain probabilistic guarantee that the system will keep evolving within a desired ‘safe’ region of the state space is characterized in terms of a value function, and ‘maximally safe’ Markov policies are determined via dynamic programming. These results are of interest not only for safety analysis and design, but also for solving those regulation and stabilization problems that can be reinterpreted as safety problems. The temperature regulation problem presented in the paper as a case study is one such case.     

Bisimilar linear systems

The notion of bisimulation in theoretical computer science is one of the main complexity reduction methods for the analysis and synthesis of labeled transition systems. Bisimulations are special quotients of the state space that preserve many important properties expressible in temporal logics, and, in particular, reachability. In this paper, the framework of bisimilar transition systems is applied to various transition systems that are generated by linear control systems. Given a discrete-time or continuous-time linear system, and a finite observation map, we characterize linear quotient maps that result in quotient transition systems that are bisimilar to the original system. Interestingly, the characterizations for discrete-time systems are more restrictive than for continuous-time systems, due to the existence of an atomic time step. We show that computing the coarsest bisimulation, which results in maximum complexity reduction, corresponds to computing the maximal controlled or reachability invariant subspace inside the kernel of the observations map. These results establish strong connections between complexity reduction concepts in control theory and computer science.     

Fractional variable order discrete-time systems,their solutions and properties

In this paper, fractional variable order discrete state-space systems based on different definitions of fractional variable order difference are investigated.The general solution of these systems is derived. Moreover, necessary and sufficient conditions for reachability and observability are given and proven. The sufficient conditions for controllability are proposed too.     

时间Petri网分析工具的实现

时间Petri网是非常适合描述实时系统的模型工具,由于时间的复杂性因素使得它的可达性分析变得非常困难。该文在分析了基于全局时间变量的时间Petri网的可达性算法的基础上,采用OOP技术,实现了一个时间petri网的分析工具。     

An Undecidable Problem for Timed Automata

The reachability problem for timed automata is decidable when the coefficients in the guards are rational numbers. We show that the reachability problem is undecidable when the coefficients are chosen from the set . A consequence of this is that the parameter synthesis problem for timed automata with even a single parameter is undecidable. We discuss why such undecidability results arise in timed and hybrid systems, what they mean, and if it is possible to get around them.     

Verifying lossy channel systems has nonprimitive recursive complexity

Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. It is known that reachability, termination and a few other verification problems are decidable for these systems. In this article we show that these problems cannot be solved in primitive recursive time.