离散事件系统不透明性监督控制研究综述

离散事件系统不透明性是指外部观察者无法分辨系统的一系列行为是否为系统所发生的.而离散事件不透明性监督控制则是构建监督器控制系统行为,使系统满足不透明性的一种方法.离散事件系统不透明性与信息安全有着紧密的联系,并得到了广泛的应用.首先对离散事件系统做了简要的概述,然后介绍了不透明性监督控制算法的研究现状,最后进行了总结和展望.     

不完备离散事件系统的当前状态不透明性

本文针对不完备系统模型,研究不完备离散事件系统的当前状态不透明性.根据系统的实际输出与预测输出之间的差异,构建了一个具有学习功能的学习诊断器.这种学习诊断器不仅能够模拟系统的状态转移,而且还可以将系统缺失的状态信息通过学习得到恢复.通过引入集合覆盖理论处理由学习诊断器得出的结果,提出了一种基于学习诊断器的不完备离散事件系统当前状态不透明性的验证算法.     

基于粗糙集理论的离散事件系统不透明性的验证算法

近年来,离散事件系统的不透明性研究引起了国内外众多学者的广泛关注.本文针对离散事件系统的不透明性,提出了一种将粗糙集理论作为知识提取工具来处理离散事件系统不透明性验证的方法.先对离散事件系统的不透明性进行形式化,再利用粗糙集理论对离散事件系统以信息表及决策表的形式进行表示,得到一个关于离散事件系统不透明性的充分必要条件.在此基础上,给出一个验证离散事件系统不透明性算法.与现有方法相比,该验证算法既适用于对强不透明性的验证,又适用于对弱不透明性的验证,并且在时间复杂度上也有较明显改进.     

离散事件动态系统的分层最优监控

采用流网络的完备最小割将Ｋｕｍａｒ提出的离散事件系统最优监控理论拓展到标识语言的情形,提出了在受控系统的可达状态集中优化某种指标的分层优化思想,给出了寻找可控最优子语言的算法。     

离散事件系统规范DEVS研究

离散事件系统是一类常见的系统,如何对这类系统进行描述与建模是离散事件系统仿真研究的核心内容。离散事件系统规范DEVS是一种离散事件系统形式化描述方法,它具有层次化和模块化的特点,利用该方法可对复杂的离散事件系统进行建模、设计、分析和仿真。该文详细介绍了DEVS基本模型和耦合模型,给出了DEVS在耦合运算下的封闭性构造证明,并提出了一种具有嵌套层次结构的DEVS耦合模型实现算法,该算法对基于DEVS描述的离散事件系统的仿真实现具有一定参考价值。     

离散事件系统并发仿真环境

本文提出了并发仿真思想。并介绍了针对柔性制造系统仿真研制的离散事件系统并发仿真环境:将制造系统作为仿真对象部分,将控制、调度等管理方法作为决策部分,仿真对象部分和决策部分作为两个独立的作业并发执行,它们交互作用完成整个仿真过程。介绍了一个将上述两部分连接成一个完整仿真系统的接口(软件)。     

离散事件系统的协调反馈控制

本文探讨以Ｐｅｔｒｉ网为模型的离散事件系统（ＤＥＳ）的某种禁止状态避免问题,提出了以Ｐｅｔｒｉ网Ｎ为基网,设计具有外部输入位置Ｐｅｔｒｉ网（ＰＮＩＰ）,对Ｎ进行协调反馈控制的方法。由Ｎ现行状态反馈决定的ＰＮＩＰ的控制状态,既保证Ｎ避免禁止状态,又使Ｎ具有最大自由度。     

离散事件动态系统稳定性分析方法

本文提出一种受控时序PETRI网络方法以建立离散事件动态系统状态空间模型,并以此为基础给出一类离散事件系统的稳定性定义及一种新的稳定性分析方法.     

Relative predictability of failure event occurrences and its opacity-based test algorithm

In this paper, the problem of relative predictability of failure event occurrences is investigated. The notion of relative predictability is proposed for logical automata and the concept of predictable rate is introduced to characterise the predictability property of a discrete-event system, which takes values in the interval [0, 1]. Intuitively, a discrete-event system being relatively predictable means that there exist some failure events which can be predicted from the observations of the system. The relationship between relative predictability and predictability introduced by Sahika Genc et al. analysed and the analysis shows that relative predictability is weaker than predictability for discrete-event systems. Furthermore, a necessary and sufficient condition for relative predictability is presented. In particular, an opacity-based algorithm is developed to test the relative predictability, which is polynomial in the number of states of the system. Also, some examples are provided to illustrate the presented results.     

Modular Control and Coordination of Discrete-Event Systems

In the supervisory control of discrete-event systems based on controllable languages, a standard way to handle state explosion in large systems is by modular supervision: either horizontal (decentralized) or vertical (hierarchical). However, unless all the relevant languages are prefix-closed, a well-known potential hazard with modularity is that of conflict. In decentralized control, modular supervisors that are individually nonblocking for the plant may nevertheless produce blocking, or even deadlock, when operating on-line concurrently. Similarly, a high-level hierarchical supervisor that predicts nonblocking at its aggregated level of abstraction may inadvertently admit blocking in a low-level implementation. In two previous papers, the authors showed that nonblocking hierarchical control can be guaranteed provided high-level aggregation is sufficiently fine; the appropriate conditions were formalized in terms of control structures and observers. In this paper we apply the same technique to decentralized control, when specifications are imposed on local models of the global process; in this way we remove the restriction in some earlier work that the plant and specification (marked) languages be prefix-closed. We then solve a more general problem of coordination: namely how to determine a high level coordinator that forestalls conflict in a decentralized architecture when it potentially arises, but is otherwise minimally intrusive on low-level control action. Coordination thus combines both vertical and horizontal modularity. The example of a simple production process is provided as a practical illustration. We conclude with an appraisal of the computational effort involved.     

Hierarchical control of timed discrete-event systems

An abstract hierarchical control theory is developed for a class of timed discrete-event systems (TDES) within the discrete-event control architectural framework proposed earlier by the authors. For this development, a control theory for TDES is introduced in the spirit of a prior theory of Brandin. A notion of time control structures is introduced, and on its basis a general property of hierarchical consistency is achieved by establishing control consistency — namely preservation of time control structures through the aggregation mapping in a two-level hierarchy.     

不确定观测下离散事件系统的可诊断性

从系统诊断的角度来看,可诊断性是离散事件系统的一个重要性质.其要求系统发生故障后经过有限步的观测可以检测并隔离故障.为简单起见,对离散事件系统可诊断性的研究大都假定观测是确定的,即观测到的事件序列与系统实际发生的可观测事件序列一致.而在实际应用中,由于感知器的精度、信息传输通道的噪声等原因,获取的观测往往是不确定的.本文重点研究观测不确定条件下离散事件系统的可诊断性问题.首先,扩展了传统可诊断性的定义,定义了观测不确定条件下的可诊断性.接着,分别给出各类观测不确定条件下的可诊断性判定方法.而在更一般的情况下,各类观测不确定可能共同存在.因此,最后给出一般情况下的可诊断性判定方法.     

Supervisory Control of Distributed Systems: Conflict Resolution

In distributed synthesis and control, one well-known potential hazard is conflict between modular designs. In a modular approach to the supervisory control of discrete-event systems, modular supervisors that are individually nonblocking (with respect to the plant) may nevertheless conflict and thus produce blocking, or even deadlock, when operating concurrently. A scheme of resolving this potential conflict between the modular supervisors would be to accord priorities to the conflicting supervisors. When conflict arises, the modular supervisor that is assigned a higher priority will have sole control, or in other words the control action of the lower priority supervisor will be suspended. Thus by assigning priority appropriately, control actions of the modular supervisors will be suspended and reactivated in such a way that the potential conflict can be averted. In this article we formalize this scheme with reporter maps from a hierarchical approach to the supervisory control of discrete-event systems. These maps, each acting as an interface between a modular supervisor and the plant, mediate the flow of information and control, and thus in this way achieve suspension and reactivation of the modular supervisors. Sufficient conditions on these reporter maps for conflict resolution are obtained. Roughly speaking, the conditions are that (1) the reporter maps select suitable subsystems of the plant; (2) within these subsystems, conflicts are resolved; (3) the reporter maps are refined enough to lift these local conflict resolutions back to the original plant. With these conditions, a constructive solution is developed, which in essence suspends a supervisor just in time to prevent conflict and reactivates it when the plant and the other supervisor return to the state they were in when the suspension began. Examples inspired by the feature interaction problem in telecommunication systems are provided for illustration.     

一类分布式系统的模块化诊断方法

提出了一种针对一类大规模分布式系统的模块化诊断方法. 该方法基于离散事件动态系统的诊断理论, 其模块化特征不但使得诊断器的构造不用考虑整个系统的情况, 而且大大减少了系统构成的变化对已构建好的诊断器的影响.     

The relationship of controllability between classical and fuzzy discrete-event systems

We have known that the controllability of classical discrete-event systems has already been extended into fuzzy discrete-event systems. In this paper, firstly, we recall some related definitions and results of the controllability for classical and fuzzy discrete-event systems, respectively. Secondly, we are concerned with the relationship of the controllability between classical and fuzzy discrete-event systems. In particular, we show that there is an equivalence of the controllability between the two systems to some extent, some special proofs are also presented. Finally, we use this equivalence to extend some general controllability properties of classical discrete-event systems into fuzzy ones.