基于图形处理离散事件系统监控阻塞的新方法

本文提出了一种基于图形处理监控阻塞问题(SCPB)的新方法,用该方法可有效、直观地分析、求解SCPB。为此,本文给出了改进满意程度(SM)和阻塞程度(BM)的几种方法,并指出了这些方法的特性,从而得以同时改进SM和BM,并优化现有的监控器。     

用神经网络实现离散事件系统监控可能性研究

本文讨论了Hopfield神经网络的以描述人造系统为主的离散事件系统打似之处，以及用神经网络作为离散事件系统模型和监控器的可能性，并指出神经网络优化算法用于实时监控综合的优点及需要解决的问题。     

离散事件系统监控与状态反馈方法的等价性

本文证明控制指标以谓词形式给出时,采用监控方法能使受控离散事件过程的可达状态与采用状态反馈逻辑的可达状态相同;控制指标以语言形式语言形式给出时,采用状态反馈逻辑也能使受控离散事件过程生成采用监控方法时生成的语言,因而从综合角度看,这两种方法等价。     

基于非齐整自动机模型的离散事件系统监控

本文研究了一类不能用齐整自动机建模的离散事件系统的监控问题,首先介绍了自动机齐整性的定义及检测方法，接着给出了将系统分解为若干个子系统的算法，最后讨论了系统监控问题，所得结果具有一定的参考价值。     

模糊离散事件系统监督控制理论

为了将经典离散事件系统 (Discrete event systems, DES) 中的监控理论扩展到模糊离散事件系统 (Fuzzy discrete event systems, FDES) 中, 总结了目前 FDES 建模和监控理论方面的成果, 进一步讨论了 FDES 的能控性, 给出了非阻塞监控的条件. 对 FDES 的能控子语言与优化监控进行了分析, 得到了能控子语言的性质. 以模糊自动机作为监控的一种形式, 给出了监督控制具体的实现方法, 这对于进一步开展 FDES 的研究工作是有益的.     

离散事件动态系统的代数模型及其控制器的分析计算

本文在离散事件动态系统的Ｐｅｔｒｉ网图形描述的基础上建立了相应的代数模型，该模型可以用来计算无竞争无回路Ｐｅｔｒｉ网的“最大状态”；该“最大状态”的计算在本文给出的动态反馈控制器中得到了应用。     

基于现场可编程门阵列的新型可编程逻辑控制器在线调试技术

针对基于现场可编程门阵列(FPGA)的新型可编程逻辑控制器(FPGA based PLC)的在线监控问题,提出了泛化的基于FPGA技术对嵌入式片上系统(SoC)进行在线监控的方法。该方法设计了一个FPGA片上通信系统,系统内部固化基于UART的ModBus通信协议栈,通过串口与计算机上位机进行通信;采用双口RAM(DRAM)作为与监控对象间共享的数据缓存区,通过中断机制实现缓存数据的同步交换。性能分析结果表明,该方法将SoC处理监控通信的时间百分比降低至0.002%,确保了监控数据传送的实时性,且使SoC能够获得更佳控制性能。在Altera的cycloneⅡ系列芯片开发板上验证了方案的可行性。     

离散事件控制器综合与重构的研究

讨论了离散事件控制器快速综合与重构方面研究的意义以及存在的问题,介绍了基于改进的网重写系统的Petri网离散事件控制器快速综合与重构理论与方法的研究进展及其仿真系统开发。     

事件图的混合控制器设计

指数级计算复杂性的可达性分析导致较大规模Petri 网上的监控器设计非常困难. 为了解决这一问题, 本文给出了事件图上的混合型控制器设计方法：首先得到了观测器的设计方法;其次给出了根据观测器计算最大允许控制策略的算法. 结果表明,该方法降低了需要观测的状态空间的维数,从而提高了计算效率,并且该方法不要求对象网是活的或有界的.     

离散事件系统的混合分散监控

研究了混合信息下的分散监控综合问题.首先提出δ-可观察(hδ-可观察)可控闭语言是(状态部分可观察下)状态反馈综合解存在的充要条件,并由此得到n-联合可观察、可控闭的系统约束是保证混合分散监控器存在的充要条件,进而得到纯分散监控器(控制器)存在的充要条件为n-可观察(n-hδ-可观察)可控闭语言被满足.最后,又通过研究系统约束与混合约束的关系,提出混合分散监控器存在的充分条件是可观察、可控闭语言与可观察可控谓词被满足.     

On tolerable and desirable behaviors in supervisory control of discrete event systems

We formulate and solve a new supervisory control problem for discrete event systems. The objective is to design a logical controller—or supervisor—such that the discrete event system satisfies a given set of requirements that involve event ordering. The controller must deal with a limited amount of controllability in the form of uncontrollable events. Our problem formulation considers that the requirements for the behavior (i.e., set of traces) of the controlled system are specified in terms of a desired behavior and a larger tolerated behavior. Due to the uncontrollable events, one may wish to tolerate behavior that sometimes exceeds the ideal desired behavior if overall this results in achieving more of the desired behavior. The general solution of our problem is completely characterized. The nonblocking solution is also analyzed in detail. This solution requires the study of a new class of controllable languages. Several results are proved about this class of languages. Algorithms to compute certain languages of interest within this class are also presented.Research supported in part by the National Science Foundation under grants ECS-8707671, ECS-9057967, and ECS-9008947.     

Relative coobservability for decentralised supervisory control of discrete-event systems

In this paper, we study the concept of relative coobservability in decentralised supervisory control of discrete-event systems under partial observation. This extends our previous work on relative observability from a centralised setup to a decentralised one. A fundamental concept in decentralised supervisory control is coobservability (and its several variations); this property is not, however, closed under set union, and hence there generally does not exist the supremal element. Our proposed relative coobservability, although stronger than coobservability, is algebraically well behaved, and the supremal relatively coobservable sublanguage of a given language exists. We present a language-based algorithm to compute this supremal sublanguage; the algorithm allows straightforward implementation using off-the-shelf algorithms. Moreover, relative coobservability is weaker than conormality, which is also closed under set union; unlike conormality, relative coobservability imposes no constraint on disabling unobservable controllable events.     

离散事件系统的混合可靠分散监控

在研究基于混合信息的分散监控时,由于部分监控器与部分控制器发生失败,故提出了一种新型的混合可靠分散监控问题.通过修改局部可控事件集与不可控事件集,提出新的可控语言与可靠联合可观察语言定义,进而得到混合可靠分散监控器存在的充分必要条件就是整体约束语言是可靠联合可观察,可控闭的.之后,又通过研究整体约束与混合子约束之间的关系,给出了判别混合可靠分散监控器存在的一个充分条件,即混合子约束分别满足基于谓词的可观察,可控性与基于语言的联合可观察,可控封闭性.     

Modular supervisory control of discrete-event systems

A modular approach to the supervisory control of a class of discrete-event systems is formulated, and illustrated with an example. Discrete-event systems are modeled by automata together with a mechanism for enabling and disabling a subset of state transitions. The basic problem of interest is to ensure by appropriate supervision that the closed loop behavior of the system lies within a given legal behavior. Assuming this behavior can be decomposed into an intersection of component restrictions, we determine conditions under which it is possible to synthesize the appropriate control in a modular fashion. The work of this author was supported by NSERC (Canada) under Grant No. A-7399. The work of this author was supported by the National Science Foundation through Grant No. ECS-8504584.     

A design fix to supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks

In the article ‘Supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks’, Park and Cho presented a systematic way of computing a largest fault-tolerant and schedulable language that provides information on whether the scheduler (i.e., supervisor) should accept or reject a newly arrived aperiodic task. The computation of such a language is mainly dependent on the task execution model presented in their paper. However, the task execution model is unable to capture the situation when the fault of a processor occurs even before the task has arrived. Consequently, a task execution model that does not capture this fact may possibly be assigned for execution on a faulty processor. This problem has been illustrated with an appropriate example. Then, the task execution model of Park and Cho has been modified to strengthen the requirement that none of the tasks are assigned for execution on a faulty processor.     

Synthesis of controllers for symmetric systems

This article deals with supervisory control problem for coloured Petri (CP) nets. Considering a CP-net, we build a condensed version of the ordinary state-space, namely the symbolic reachability graph (SRG). This latter graph allows to cope with state-space explosion problem for symmetric systems. The control specification can be expressed in terms of either forbidden states or forbidden sequences of transitions. According to these specifications, we derive the controller by applying the theory of regions on the basis of the SRG. Thanks to expressiveness power of CP-nets, the obtained controller to be connected to the plant model is reduced to one single place.     

组件多工作模式下的离散事件系统监督控制方法研究

针对组件多工作模式下的离散事件系统,提出一种监督控制方法.利用Ramadge-Wonham监督控制架构,计算出组件各工作模式下对应的监督控制器.然后,利用所提的merge算法将组件各工作模式下对应的监督控制器合并,以生成融合监督控制器.再利用所提的事件选择函数得到在融合监督控制器各状态允许发生的事件,从而保证系统在融合监督控制器作用下的可控且非阻塞运行.最后,通过一个带反馈功能的制造系统演示本文所提方法的有效性,该系统中的检测单元将根据工件未通过检测的次数选择工作模式.相比于运用扩展有限状态机进行变量抽象的方法,本文所提方法更加直观简便,并能适应多个工件同时处于系统中时的情形.     

Decentralized supervisory control of nondeterministic discrete event systems: The existence condition of a robust and nonblocking supervisor

This paper addresses a decentralized supervisory control problem for an uncertain discrete event system (DES) modeled by a set of possible nondeterministic automata with unidentified internal events. For a given language specification, we present the existence condition of a robust and nonblocking decentralized supervisor that achieves this specification for any nondeterministic model in the set. In particular, we show that the given language specification can be achieved based on the properties of its controllability and coobservability with respect to the overall nominal behavior of the uncertain DES. It is further shown that the existence of a nonblocking decentralized supervisor can be examined with a trajectory model of the language specification.