Active fault tolerant control of discrete event systems using online diagnostics

The aim of this paper is to deal with the problem of fault tolerant control in the framework of discrete event systems modeled as automata. A fault tolerant controller is a controller able to satisfy control specifications both in nominal operation and after the occurrence of a fault. This task is solved by means of a parameterized controller that is suitably updated on the basis of the information provided by online diagnostics: the supervisor actively reacts to the detection of a malfunctioning component in order to eventually meet degraded control specifications. Starting from an appropriate model of the system, we recall the notion of safe diagnosability as a necessary step in order to achieve fault tolerant control. We then introduce two new notions: (i) “safe controllability”, which represents the capability, after the occurrence of a fault, of steering the system away from forbidden zones and (ii) “active fault tolerant system”, which is the property of safely continuing operation after faults. Finally, we show how the problem can be solved using a general control architecture based on the use of special kind of diagnoser, called “diagnosing controller”, which is used to safely detect faults and to switch between the nominal control policy and a bank of reconfigured control policies. A simple example is used to illustrate the new notions and the control architecture introduced in the paper.     

Partial order reduction for state/event LTL with application to component-interaction automata

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL (Chaki et al. (2004, 2005) [1] and [2]) incorporates both states and events to express important properties of component-based software systems.The main contribution of this paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence. The positive attribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weak state/event LTL, which is invariant under the new equivalence.To bring some evidence of the method’s efficiency, we present some of the results obtained by employing the partial order reduction technique within our tool for verification of component-based systems modelled using the formalism of component-interaction automata (Brim et al. (2005) [3]).     

Multi‐agent system for knowledge‐based event recognition and composition

This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored.     

关于INTEL96系列单片机中HSO事件的设置

就ＭＣＳ－９６系列单片机中设置ＨＳＯ事件时,若事件的触发时间超过定时器Ｔ１、Ｔ２的溢出间隔的问题进行了讨论,给出了具体的解决方案,对许多文献资料中关于这一问题的论述进行了补充,具有实用意义。     

基于CHECK方式的联锁仿真系统的设计与实现

针对城市轨道交通包括地铁、轻轨等的过渡信号系统的特点,研制了CHECK方式的列车运行控制系统1。文章在分析基于CHECK方式的联锁与闭塞系统的工作原理的基础上,给出了联锁仿真系统的数学模型,提出了用“事件调度法”这一仿真技术实现CHECK方式的联锁系统的仿真,并予以实现,满足了实际应用的需要。     

在VC6.0中怎样彻底隐藏程序

本文介绍了,在VC6.0中怎样将程序彻底隐藏起来,在程序执行过程中,用户不能终止和看到程序的运行。     

PowerBuilder中函数和事件调用若干方法的分析与示例

对PowerBuilder中的函数与事件调用的三种方法作了较详尽的分析,并给出了每种方法的一些应用示例.     

在VB5.0中创建自定义类

首先介绍了ＶＢ５．０中创建自定义的基本步骤,然后详细描述了如何向类中添加属性、方法和事件。     

An optimal effective controller for discrete event systems

An approach to the online synthesis of an optimal effective controller for discrete event systems is presented. The optimal effective controller can achieve the prescribed (cumulative) effectiveness measure while minimizing the total cost incurred for the execution of events. This approach is constructed over a generalized control framework for automata‐based discrete event systems, which allows event enforcement in addition to the (original) event disablement/enablement as the control mechanism. The optimal effective control policy generated by this approach is proved to be the least restrictive among all the possible optimal effective control policies for the given online expansion tree of the system behavior. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Optimal Control of Two-Stage Discrete Event Systems with Real-Time Constraints

We consider discrete event systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task meeting its own constraint. When tasks are processed over a single stage, it has been shown that there are structural properties of the optimal sample path that lead to very efficient solutions of such problems. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, these properties no longer hold and no obvious extensions are known. We consider a two-stage problem with homogeneous cost functions over all tasks at each stage and derive several new optimality properties. These properties lead to the idea of introducing “virtual” deadlines at the first stage, thus partially decoupling the stages so that the known efficient solutions for single-stage problems can be used. We prove that the solution obtained by an iterative virtual deadline algorithm (VDA) converges to the global optimal solution of the two-stage problem and illustrate the efficiency of the VDA through numerical examples.