离散事件系统基于模式的安全故障诊断

基于模式的故障诊断方法能将触发系统故障的事件串诊断出来,但在诊断期间系统仍然可能执行被禁止的不安全操作.为此,提出了一种离散事件系统基于S型和T型模式的安全诊断方法.先对离散事件系统基于模式的安全可诊断性进行形式化,再通过构造非法语言识别器和安全诊断器对系统发生的故障模式实施安全诊断,最后分别得到了一个关于S型和T型模式的系统安全可诊断性的充分必要条件,实现了离散事件系统基于模式的安全故障诊断.     

分布式模糊离散事件系统的故障预测

本文研究分布式模糊离散事件系统的故障预测问题.先根据系统的模糊特性,提出一种分布式模糊离散事件系统的协同可预测性的形式化方法,使分布式模糊离散事件系统的协同可预测度不小于各分站点的局部可预测度.通过构造协同预测验证器,提出一种基于协同预测验证器的协同预测算法,并得到一个关于分布式模糊离散事件系统协同可预测性的充分必要条件.     

具有多项式时间复杂性的离散事件系统安全诊断

离散事件系统的故障诊断能将已发生的不可观故障事件及时诊断出来,但往往容易忽略故障诊断期间系统的安全性.为解决这一问题,提出了一种具有多项式时间复杂性的安全故障诊断方法.先对离散事件系统的安全可诊断性进行了形式化,再通过构造一个非法语言识别器对系统被禁止操作序列进行识别,并在此基础上构建了一个对系统实施安全诊断的安全验证器,得到了一个关于离散事件系统安全可诊断性的充分必要条件,实现了对系统的安全故障诊断.同时,通过对安全验证器的构建与安全可诊断性的判定的复杂性分析,得到了该安全故障诊断方法可在多项式时间内实现等结论.     

离散事件系统间歇性故障的安全诊断

离散事件系统的间歇性故障诊断能够将系统中发生的间歇性故障及时诊断出来,但在诊断期间的系统可能会执行不安全操作.针对间歇性故障在诊断期间的安全性问题,提出一种基于事件的安全诊断方法.首先对发生间歇性故障的离散事件系统进行建模,并给出系统间歇性故障的安全可诊断性的形式化定义.然后通过构造非法语言识别器对系统的非法操作进行识别,并在此基础上构建一个安全验证器,由此得到一个关于系统间歇性故障安全可诊断性的充分必要条件,实现离散事件系统对间歇性故障的安全诊断.这种安全诊断既保证了间歇性故障一旦发生即能被及时诊断出来,又确保了在故障诊断期间系统不会执行任何不安全操作.     

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

在实际应用系统中,由于传感器故障、传感器限制和网络中的数据包丢失等原因,事件的可观测值变得不确定,使得观测系统行为变得尤为复杂。针对离散事件系统中,同个事件串可能有多个观测值以及不同状态下同个事件观测值也可能不同的问题,提出一种不确定观测下故障诊断验证的方法。首先对不确定观测的离散事件系统的可诊断性进行形式化,然后构建出用于上述故障诊断验证的验证器;基于验证器提出了系统基于不确定观测下可诊断的充要条件及验证算法;最后,实例说明不确定观测下故障诊断验证算法的应用。与现有研究相比,提出的方法对故障事件的观测值没有约束,可以为0个或多个观测值,使此方法应用的场景更为广泛。     

基于动态观测的随机离散事件系统故障诊断

近年来,离散事件系统故障诊断研究引起国内外学者广泛关注.鉴于此,研究动态观测下随机离散事件系统的故障诊断.首先引入一种动态观测,使事件的可观测性随着系统的运行而动态变化;然后分别对基于动态观测的随机离散事件系统的单故障可诊断性和模式故障可诊断性进行形式化;最后通过构造相应的诊断器,分别得到关于单故障可诊断性和模式故障可...     

基于Petri网诊断器的离散事件系统模式故障的在线诊断

本文研究基于Petri网诊断器的离散事件系统模式故障的在线诊断问题. 先构建一种用于模式故障在线诊 断的自动机, 给出了基于这种自动机的在线诊断方法. 然后将自动机转换为Petri网并进一步构造了可用于S型模式 故障或T型模式故障在线诊断的Petri网诊断器, 提出了基于Petri网诊断器的模式故障在线诊断算法. 通过分析算法 的复杂性, 得到了该算法具有多项式空间复杂性的结论.     

分层离散事件系统的不透明性

针对离散事件系统（DES）的不透明性问题，结合具有分层（hierarchical）结构的自动机模型，提出了分层离散事件系统的不透明性.对分层离散事件系统进行标准化，给出了分层离散事件系统不透明性和K延迟不透明性两个概念.为了对分层离散事件系统的两种不透明性进行验证，分别构造了两种相应的不透明性验证器，得到了关于不透明性和K延迟不透明性的充分必要条件，并对构造不透明性验证器的复杂度进行了分析.     

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

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

分布式随机离散事件系统的模式故障预测EI北大核心CSCD

本文以随机自动机为模型,研究分布式随机离散事件系统的模式故障预测问题.首先根据分布式随机离散事件系统的分布特性对模式故障协同可预测性概念进行形式化,并通过构造模式故障识别器来识别系统中发生的模式故障.然后,构造一个模式故障协同预测器,提出一种基于协同预测器的具有多项式复杂度的算法,得到关于分布式随机离散事件系统模式故障协同可预测性的充分必要条件,实现对分布式随机离散事件系统的模式故障预测.     

Diagnosability of fuzzy discrete event systems

In this paper, discrete event systems (DESs) are reformulated as fuzzy discrete event systems (FDESs) and fuzzy discrete event dynamical systems (FDEDSs). These frameworks include fuzzy states, events and IF-THEN rules. In these frameworks, all events occur at the same time with different membership degrees. Fuzzy states and events have been introduced to describe uncertainties that occur often in practical problems, such as fault diagnosis applications. To measure a diagnoser’s fault discrimination ability, a fuzzy diagnosability degree is proposed. If the diagnosability of the degree of the system yields one a diagnoser can be implemented to identify all possible fault types related to a system. For any degree less than one, researchers should not devote their time to distinguish all possible fault types correctly. Thus, two different diagnosability definitions FDEDS and FDES are introduced. Due to the specialized fuzzy rule-base embedded in the FDEDS, it is capable of representing a class of non-linear dynamic system. Computationally speaking, the framework of diagnosability of the FDEDS is structurally similar to the framework of diagnosability of a non-linear system. The crisp DES diagnosability has been turned into the term fuzzy diagnosability for the FDES. The newly proposed diagnosability definition allows us to define a degree of diagnosability in a class of non-linear systems. In addition, a simple fuzzy diagnosability checking method is introduced and some numerical examples are provided to illustrate this theoretical development. Finally, the potential applications of the proposed method are discussed.     

Diagnosability of delay-deadline failures in fair real time discrete event models

In this article a method for failure diagnosis of real time discrete event systems (RTDES) with ‘fairness of traces’ has been developed. Discrete event system (DES) modelling framework with provision for associating timing information with the transitions are required for handling real time systems. RTDES models and timed DES (TDES) models are examples of such modelling frameworks. Failure diagnosis in untimed DES models enables only the study of diagnosability of failures resulting in a change in the logical behaviour of the failed system. In addition to logical failures, failure diagnosis in RTDES and TDES models also enables diagnosability of failures that change the timing behaviour of the system but maintain the logical behaviour. Many systems exhibit fairness of traces with respect to transitions in the sense that any trace that visits a state infinitely often has infinitely many occurrences of all the transitions that emanate from that state. The abstraction employed in obtaining their (timed) DES models often obliterates this property. The RTDES and TDES diagnosability conditions, proposed in the literature and which do not consider fairness, are shown to be inadequate in this article. A new diagnosability condition is achieved by taking into account this fairness property in the RTDES models and shown to be necessary and sufficient for such systems. An analysis of time complexity for analysing the diagnosability of systems with fairness of traces is presented.     

Diagnosability of discrete event systems subject to permanent sensor failures

This paper considers a failure diagnosis problem for discrete event systems subject to permanent sensor failures. A notion of diagnosability subject to permanent sensor failures is introduced with respect to a certain nondeterministic observation mask. For its verification, an aggregated Mealy automaton with a deterministic and state-dependent observation mask is defined. It is shown that the diagnosability of the aggregated Mealy automaton is equivalent to the diagnosability of the original system subject to permanent sensor failures. Then, a method for verifying the diagnosability of the aggregated Mealy automaton is presented. Moreover, the delay bound within which the occurrence of any failure string can be detected subject to permanent sensor failures is computed.     

Diagnosability of Fuzzy Discrete-Event Systems: A Fuzzy Approach

In order to more effectively cope with the real-world problems of vagueness, fuzzy discrete-event systems (FDESs) were proposed by Lin and Ying recently. Then we and Cao and Ying investigated the supervisory control of FDESs independently. In this paper, we are concerned with another important issue of FDESs, the failure diagnosis. More specifically: (1) we propose a ldquofuzzy diagnosabilityrdquo approach by introducing a fuzzy diagnosability function to characterize the diagnosability degree, which takes values in the interval [0,1] rather than { 0,1}; (2) based on the observability of events, we formalize the construction of the diagnosers that are used to perform fuzzy diagnosis; (3) a number of basic properties of the diagnosers are investigated. In particular, we present a necessary and sufficient condition for failure diagnosis of FDESs. Our results generalize the important consequences of the diagnosability for crisp discrete-event systems (DESs) introduced by Sampath et al. The newly proposed approach allows us to deal with the problem of diagnosability for both crisp DESs and FDESs; (4) in addition, a method for checking the fuzzy diagnosability for FDESs is proposed. Also, some examples are provided to illustrate the application of the diagnosability of FDESs.     

Fairness of Transitions in Diagnosability of Discrete Event Systems

Failure diagnosability has been widely studied for discrete event system (DES) models because of modeling simplicity and computational efficiency due to abstraction. In the literature it is often held that for diagnosability, such models can be used not only for systems that fall naturally in the class of DES but also for the ones traditionally treated as continuous variable dynamic systems. A class of algorithms for failure diagnosability of DES models has been successfully developed for systems where fairness is not a part of the model. These algorithms are based on detecting cycles in the normal and the failure model that look identical. However, there exist systems with all transitions fair where the diagnosability condition that hinges upon this feature renders many failures non-diagnosable although they may actually be diagnosable by transitions out of a cycle. Hence, the diagnosability conditions based on cycle detection need to be modified to hold for many real-world systems where all transitions are fair. In this work, however, it is shown by means of an example that a system may have some transitions fair and some unfair. A new failure diagnosability mechanism is proposed for DES models with both fair and unfair transitions. Time complexity for deciding diagnosability of DES models with fair and unfair transitions is analyzed and compared with the time complexities of other DES diagnosability analysis methods reported in the literature.     

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

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

Polynomial-time verification of diagnosability of fuzzy discrete event systems

A fuzzy approach to perform diagnosis of fuzzy discrete event systems(FDESs)is proposed by constructing diagnosers,which may more effectively cope with the problems of vagueness and fuzziness arising from failure diagnosis of fuzzy systems.However,the complexity of constructing this kind of diagnosers is exponential in the state space and the number of fuzzy events of the system.In this paper,we present an algorithm for verifying the diagnosability of FDESs based on the construction of a nondeterministic automaton called F-verifier instead of diagnosers.Both the construction of F-verifiers and the verification of diagnosability of FDESs can be realized with a polynomial-time complexity.     

Access point selection in heterogeneous wireless networks using belief propagation

The next generation wireless network will be composed by various heterogenous wireless access networks,such as cellular network,worldwide interoperability for microwave access(WiMAX),wireless local area network(WLAN),etc.Different access networks cooperatively provide high-bandwidth connectivity with bandwidth guarantees.This paper proposes a utility-based access point selection scheme,which selects an accessible point for each user,such that the bandwidth requirement of each user is satisfied,and also the defined utility function is maximized.Due to the NP-complete nature of the problem,the existing proposals apply the greedy method to find a solution.We find that belief propagation is an efficient tool to solve this problem,and thus,we derive the same optimization objective in a new way,and then draw a factor graph representation which describes our combinatorial optimization problem.Afterwards,we develop the belief propagation algorithm,and show that our algorithm converges.Finally,we conduct numerical experiments to evaluate the convergency and accuracy of the belief propagation in load balancing problem.     

A new algorithm for testing diagnosability of fuzzy discrete event systems

Failure diagnosis and detection of fuzzy discrete event systems play a significant role in the study of complex systems. In this paper, we investigate the diagnosability of fuzzy discrete event systems by proposing a new algorithm based on the concept of undistinguishable strings. Moreover, a necessary and sufficient condition for fuzzy diagnosability is obtained in terms of certain properties of the diagnoser, which is constructed with respect to the minimal observable event. The computing process to check the diagnosability of fuzzy DESs and some examples serving to illuminate the applications are developed and described.