An interval observer for uncertain continuous‐time linear systems

To design robust interval observers for uncertain continuous‐time linear systems, a new set‐integration approach is proposed to compute trajectory tubes for the estimation error. Because this approach, the order‐preserving condition on the dynamics of the estimation error is no longer required. Therefore, synthesis methods can be used to compute observer gains that reduce the impact of the system uncertainties on the accuracy of the estimated state enclosures. The performance of the proposed approach is showcased through illustrative numerical examples.     

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.      

基于快速成型技术的维修视觉可达性分析

基于快速成型技术对产品维修过程中的维修视觉可达性分析技术进行研究。分析了快速成型技术对维修性分析工作的促进作用;采用可视锥法,研究了基于快速成型技术的维修视觉可达性分析技术,提出了维修视觉可达性分析流程;从分析结论的不确定程度、观测角度两个方面分析了基于快速成型技术的维修视觉可达性分析技术的特点。     

On the reachability of a class of continuous bilinear systems

Abstract

It is well known that using differential geometric methods, the reachability of nonlinear systems can be checked via Lie algebra. Normally, the resultant checking condition is state dependent and requires complicated recursive Lie bracket operations. In this paper, it is shown that for dyadic bilinear systems, the reachability property is actually state independent, and hence a global property of the system. Specifically, it is proved that the Lie algebra condition is equivalent to the rank conditions of two constant matrices. As examples, the reachability of two real‐world systems is examined through the new checking condition.     

基于多面体包含的非线性混成系统可达性分析

针对一类非线性混成系统的可达性问题,提出了一种基于多面体包含的分析方法。首先介绍了混成系统及其可达性,讨论了如何应用多面体包含对多项式混成系统进行线性近似,并采用量词消去和非线性优化方法来构造相应的线性混成系统,然后运用验证工具SpaceEx求得原非线性混成系统的过近似可达集,并应用于验证系统的安全性。     

The complexity of some reachability problems for a system on a finite group

We consider a system defined as the product of a finite set of periodic systems on cyclic groups. It is of interest to determine if certain subgroups and unions of subgroups of the state set are reachable from a specified initial state, and in particular to determine the computational complexity of verifying such reachability. These questions are motivated by certain problems that arise in the modelling and control of discrete event systems and certain forms of periodic scheduling. Our main result is that deciding whether or not the union of a certain set of subgroups is reachable or not is NP-complete.     

Data flow analysis of distributed communicating processes

Data flow analysis is a technique essential to the compile-time optimization of computer programs, wherein facts relevant to program optimizations are discovered by the global propagation of facts obvious locally. This paper extends several known techniques for data flow analysis of sequential programs to the static analysis of distributed communicating processes. In particular, we present iterative algorithms for detecting unreachable program statements, and for determining the values of program expressions. The latter information can be used to place bounds on the size of variables and messages. Our main innovation is theevent spanning graph, which serves as a heuristic for ordering the nodes through which data flow information is propagated. We consider bothstatic communication, where all channel arguments are constants, and the more difficultdynamic communication, where channel arguments may be variables and channels may be passed as messages.A preliminary version of this paper appeared in the proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 257–268, June 1979.Supported by National Science Foundation Grant NSF MCS82-00269 and the Office of Naval Research Contract N00014-80-C-0647.Supported by National Science Foundation Grants NSF DCR-8505873 and NSF CCR-8704309.     

Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks

State space exploration is often used to prove properties about sequential behavior of Finite State Machines (FSMs). For example, equivalence of two machines is proved by analyzing the reachable state set of their product machine. Nevertheless, reachability analysis is infeasible on large practical examples. Combinational verification is far less expensive, but on the other hand its application is limited to combinational circuits, or particular design schemes. Finally, approximate techniques imply sufficient, not strictly necessary conditions.The purpose of this paper is to extend the applicability of purely combinational checks. This is generally achieved through state minimization, partitioning, and re-encoding the FSMs to factor out their differences. We focus on re-encoding. In particular, we present an incremental approach to re-encoding for verification that transforms the product machine traversal into a combinational verification in the best case, and into a computationally simpler product machine traversal in the general case.Experimental results demonstrate the effectiveness of this technique on medium-large circuits where other techniques may fail.     

临淮岗工程不同蓄水条件下的水质可达性分析

建立临淮岗工程淹没区在不同蓄水条件下的二维非稳态FVS格式水流水质模型,基于水量、水质同步实测数据对模型进行率定验证。运用所建模型对研究区域水流水质过程进行数值模拟,定量分析了研究区域在最不利条件下对临淮岗坝前水质的影响程度。对不同库容条件下在库区北部农业用水时的库区水质浓度场进行计算分析,结果表明:当上游边界来水为功能区Ⅲ类,临淮岗坝前COD、NH3-N和TP浓度都能达到GB 3838—2002Ⅲ类水质标准;当边界条件为枯水期水质时,临淮岗坝前的NH3-N浓度超标,超标率为28%,COD及TP均能达标。     

New system theory and its impact on control theory

Real systems can include two types of state variables – dynamic and static. While dynamic state variables are a common part of each system, static variables are not and their presence in a system may cause some problems if standard system theories are used. In this paper, it is shown that, due to a new system theory (NST), it is possible to work correctly with systems and subsystems which include not only dynamic state variables, but also static state variables. If standard system theories are used, static variables in the real system cause not only problems in describing systems but also some challenges in control theory. These challenges involve, for example, some questions of controllability, reachability, or observability of a plant that includes static variables or the optimal control design of a plant that includes statical state variables. Some of the challenges mentioned are addressed in this paper after a brief introduction of the NST.