基于状态图的Web导航模型及其特性分析

WWW的指数级增长和Web应用的复杂性，需要系统化的方法和模型以支持Web应用的开发，导航建模是Web应用开发的特殊需求，提出了基于状态图的Web应用的导航模型，清楚地描述了复杂、动态的Web应用的导航特性，简化了系统的维护，并提出了导航树的概念和构造算法，能够有效地分析Web应用的导航特性，如可达性、死锁等。     

Using protean for verifying a complex protocol — A case study

Communication protocols used in the field have always suffered from failures. Some of these faults are the result of design errors; others are the result of implementation errors. These errors dramatically increase maintenance cost and decrease software reliability. The best time to maintain software is during its design stage. A formal approach to developing a protocol is deemed necessary to improve the quality of communication software and to reduce maintenance costs. Protocol verification plays a major role in achieving these objectives; a protocol is first specified formally and then this formal specification is analysed using a computer-aided tool. PROTEAN is a software tool that verifies a protocol specified formally in Numerical Petri Nets. This paper describes the experience and practice of using PROTEAN to verify a complex protocol and then presents an evaluation of PROTEAN and its associated techniques in the light of protocol software development. The ISO FTAM protocol is used as a case study.     

Constrained multi-variable generalized predictive control using a dual neural network

Multi-variable generalized predictive control algorithm has obtained great success in process industries. However, it suffers from a high computational cost because the multi-stage optimization approach in the algorithm is time-consuming when constraints of the control system are considered. In this paper, a dual neural network is employed to deal with the multi-stage optimization problem, and bounded constraints on the input and output signals of the control system are taken into account. The dual neural network has many favorable features such as simple structure, rapid execution, and easy implementation. Therefore, the computation efficiency, in comparison with the consecutive executions of numerical algorithms on digital computers, is increased dramatically. In addition, the dual network model can yield the exact optimum values of future control signals while many other neural networks only obtain the approximate optimal solutions. Hence the multi-variable generalized predictive control algorithm based on the dual neural network is suitable for industrial applications with the real-time computation requirement. Simulation examples are given to demonstrate the efficiency of the proposed approach.     

On Symbolic Verification of Weakly Extended PAD

We consider the verification problem of a class of infinite-state systems called wPAD. These systems can be used to model programs with (possibly recursive) procedure calls and dynamic creation of parallel processes. They correspond to PAD models extended with an acyclic finite-state control unit, where PAD models can be seen as combinations of prefix rewrite systems (pushdown systems) with context-free multiset rewrite systems (synchronization-free Petri nets). Recently, we have presented symbolic reachability techniques for the class of PAD based on the use of a class of unranked tree automata. In this paper, we generalize our previous work to the class wPAD which is strictly larger than PAD. This generalization brings a positive answer to an open question on decidability of the model checking problem for wPAD against EF logic. Moreover, we show how symbolic reachability analysis of wPAD can be used in (under) approximate analysis of Synchronized PAD, a (Turing) powerful model for multithreaded programs (with unrestricted synchronization between parallel processes). This leads to a pragmatic approach for detecting the presence of erroneous behaviors in these models based on the bounded reachability paradigm where the notion of bound considered here is the number of synchronization actions.     

Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments

By extending the previously proposed geometric branch-and-bound algorithm with bounded alignment for point pattern matching, the paper presents the development and evaluation of a new and fast algorithm for image registration based on line segments. Using synthetically generated data sets with randomly distributed line segments and hard test cases with highly symmetric line patterns, as well as real remote sensing images, the developed algorithm is shown to be computationally fast, highly robust, capable of handling severely corrupted data sets with considerable line segment position errors as well as significant fragmented and spurious line segments in the images to be matched.     

线性切换系统一致能控性和能观性的充要条件

研究线性切换系统的一致能控、能观和能达性．首先给出轨道算子、一致能控状态集和一致能达状态集的概念，然后利用轨道算子、一致能控和一致能达状态集，分别给出了线性切换系统的一致能控、能达和能观性的充要条件．证明了线性切换系统一致完全能控、能达或能观的充要条件是，每一个子系统都是能控、能达或能观的．     

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.     

ON THE PROBLEM OF REPRESENTATION IN LOCKEAN AND DIALECTICAL BELIEF SYSTEMS: A SYSTEMS APPROACH TO POLICY ANALYSIS

This paper explores the problems that are associated with building a model (representation) of two systems which are central to the field of policy analysis. The systems are the Lockean and Dialectical Inquiring Systems (ISs). Given two or more belief systems, a Lockean IS will attempt to secure maximum agreement between them, whereas a Dialectical IS will attempt to secure maximum disagreement as the basis for forming a policy.