Supervisory control of timed discrete event systems under partial observation based on activity models and eligible time bounds

To avoid the state–space explosion by including tick events in timed discrete event systems (DESs) under partial observation, a notion of eligible time bounds is introduced and based on the notion, controllability and observability conditions of languages are presented. In particular, this paper shows that these controllability and observability conditions are necessary and sufficient for the existence of a supervisor to achieve the given language specification.     

Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm

In this paper, the bisimilarity control of discrete event systems (DESs) under partial observations is investigated, where the plant and the specification are allowed to be nondeterministic. A notation of simulation-based controllability and a synchronization scheme for the supervised system are formalized based on the simulation relation between the specification and the plant. It is shown that the existence of bisimilarity supervisors is characterized by the notions of the simulation-based controllability and the language observability, which extends the traditional results of supervisory control from language equivalence to bisimulation equivalence. In addition, a polynomial algorithm to test the simulation-based controllability is developed by constructing a computing tree. This algorithm together with the test of language observability can be used to check the existence of bisimilarity supervisors.     

Supervisory Control of a Class of Concurrent Discrete Event Systems Under Partial Observation

In this paper, we study supervisory control of a class of discrete event systems with simultaneous event occurrences, which we call concurrent discrete event systems, under partial observation. The behavior of the system is described by a language over the simultaneous event set. First, we prove that L_m(G)-closure, controllability, observability, and concurrent well-posedness of a specification language are necessary and sufficient conditions for the existence of a nonblocking supervisor. Next, we synthesize a supervisor that achieves the infimal closed, controllable, observable, and concurrently well-posed superlanguage of a specification language. Finally, we synthesize a supervisor that achieves a maximal closed, controllable, observable, and concurrently well-posed sublanguage of a closed specification language.     

Fault-tolerant supervisory control under C,D observability and its application

In this paper, a discrete-event dynamical system (DEDS) approach is employed to build a fault-tolerant system under partial observation with some diagnostic schemes. We address the issue of detectability for state identification and observability for achievable legal languages in DEDSs. Especially, we introduce C, D-observability conditions to determine the observability in view of supervisor synthesis. Based upon these, we study the diagnostic problems and the construction of fault-tolerant supervisory control systems with partial observations through the behavioural analysis upon a discrete-event model. A case study of a plasma etching system is described to illustrate the proposed approach.     

Robust supervisory control of a class of timed discrete event systems under partial observation

This paper studies robust supervisory control of timed discrete event systems proposed by Brandin and Wonham. Given a set of possible models which includes the exact model of the plant, the objective is to synthesize a robust supervisor such that it achieves legal behavior for all possible models. We show that controllability for each possible model and observability for a suitably defined aggregate model are necessary and sufficient conditions for the existence of a solution to the robust supervisory control problem. Moreover, when there does not exist a solution, a maximally permissive robust supervisor is synthesized under the assumption that all controllable events are observable.     

Polynomial synthesis of supervisor for partially observed discrete-event systems by allowing nondeterminism in control

We study the supervisory control of discrete-event systems (DESs) under partial observation using nondeterministic supervisors. We formally define a nondeterministic control policy and also a control & observation compatible nondeterministic state machine and prove their equivalence. The control action of a nondeterministic supervisor is chosen online, nondeterministically from among a set of choices determined offline. Also, the control action can be changed online nondeterministically (prior to any new observation) in accordance with choices determined offline. The online choices, once made, can be used to affect the set of control action choices in future. We show that when control is exercised using a nondeterministic supervisor, the specification language is required to satisfy a weaker notion of observability, which we define in terms of recognizability and achievability. Achievability serves as necessary and sufficient condition for the existence of a nondeterministic supervisor, and it is weaker than controllability and observability combined. When all events are controllable, achievability reduces to recognizability. We show that both existence, and synthesis of nondeterministic supervisors can be determined polynomially. (For deterministic supervisors, only existence can be determined polynomially.) Both achievability and recognizability are preserved under union, and also under intersection (when restricted over prefix-closed languages). Using the intersection closure property we derive a necessary and sufficient condition for the range control problem for the prefix-closed case. Unlike the deterministic supervisory setting where the complexity of existence is exponential, our existence condition is polynomially verifiable, and also a supervisor can be polynomially synthesized.     

Robust supervisory control of timed discrete event systems under partial observation based on eligible time bounds: The existence conditions

This paper addresses a supervisory control problem for uncertain timed discrete event systems (DESs) under partial observation. An uncertain timed DES to be controlled is represented by a set of possible timed models based on the framework of Brandin and Wonham [(1994). Supervisory control of timed discrete event systems. IEEE Transactions on Automatic Control, 39(2), 329-342]. To avoid the state space explosion problem caused by tick events in the timed models, a notion of eligible time bounds is proposed for a single timed model obtained from the set of all possible timed models. Based on this notion, we present the necessary and sufficient conditions for the existence of a robust supervisor achieving a given language specification for the single timed model. Moreover, we show that the robust supervisor can also achieve the specification for any timed model in the set.     

Existence and Verification for Decentralized Nondeterministic Discrete‐Event Systems Under Bisimulation Equivalence

In this paper, we study the decentralized control problem for nondeterministic discrete‐event systems (DESs) under bisimulation equivalence. In order to exactly achieve the desired specification in the sense of bisimulation equivalence, we present a synchronous composition for the supervised system based on the simulation relation between the specification and the plant. After introducing the notions of simulation‐based controllability and simulation‐based coobservability, we present the necessary and sufficient condition for the existence of a decentralized supervisor such that the controlled system is bisimilar to the specification, and an algorithm for verifying the simulation‐based coobservability is proposed by constructing a computational tree.     

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

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

Two formal methods for the synthesis of discrete event systems

The design of discrete event systems (DES) is based mainly on either analysis or synthesis approaches. In the synthesis approach, the design process starts from high level requirements which are then automatically refined to obtain lower abstraction levels. In this paper, we begin by introducing the two design approaches and defining the synthesis problem in DESs, and in protocols in particular. Then, we survey and assess some existing protocol synthesis methods. Then, we present two novel formal and systematic methods we have developed for the synthesis of DESs. The first method is used for the design of distributed systems which must satisfy some temporal constraints. The second method takes into account concepts such as controllability and observability, which are used in the control theory of DESs. Finally, we conclude and propose some future works.     

网络控制系统的能控性和能观性

给出了网络控制系统的定义，并基于线性时不变系统的被控对象，建立了传感器为时钟驱动，控制器和作动器为事件驱动时长时滞网络控制系统的数学模型，对网络控制系统的均值能控、均方能控、均值能观及均方能观作了定义，得到了网络控制系统能控的充分或必要条件及能观的充要条件．     

Minimality and local state decompositions of a nonlinear state space realization using energy functions

In this paper a set of sufficient conditions is developed in terms of controllability and observability functions under which a given state-space realization of a formal power series is minimal. Specifically, it is shown that positivity of these functions, in addition to a stability requirement and a few technical conditions, implies minimality. Using the nonlinear analogue of the Kalman decomposition, connections are then established between minimality, singular value functions, balanced realizations, and various notions of reachability and observability for nonlinear systems.     

The robustness of controllability and observability of linear time-varying systems

Fixed point methods from nonlinear analysis are used to establish conditions under which the uniform complete controllability, of linear time-varying systems is preserved under nonlinear perturbations in the state dynamics and the zero-input uniform complete observability of linear time-varying systems is preserved under nonlinear perturbation in the state dynamics and output read-out map. Robustness of partial controllability., observability, and a specific kind of nonzero input observability are also proven.     

Robust and nonblocking supervisor for discrete-event systems withmodel uncertainty under partial observation

Addresses a robust and nonblocking supervisory control problem based on a framework of discrete-event systems with model uncertainty under partial observation. The uncertainty introduced in the paper is associated with internal and unobservable events occurring in systems. The paper presents a systematic method for modeling uncertainty described as a Δ-transition representing the internal and unobservable events. In particular, at a state with the assigned positive integer value p a system is assumed to experience at most a p-step state transition by the internal and unobservable event. Under the framework for model uncertainty, the paper presents necessary and sufficient conditions for the existence of a robust supervisor with the nonblocking property     

Decentralized supervisory control of discrete event systems with communication delays based on conjunctive and permissive decision structures

In many practical discrete event systems (DESs), some unexpected and uncontrollable events can subsequently occur before a proper control action is actually applied to a plant due to communication delays. For such DESs, this paper investigates necessary and sufficient conditions for the existence of a nonblocking decentralized supervisor that can correctly achieve a given language specification when the decentralized supervisor is assumed to have a conjunctive and permissive decision structure. In particular, this paper presents a notion of delay-coobservability for a given language specification and shows that it is a key condition for the existence of such a decentralized supervisor.     

Robust and nonblocking supervisory control of nondeterministicdiscrete event systems using trajectory models

This note considers the robust supervisory control problems of uncertain nondeterministic discrete-event systems (DESs). The uncertain DES to be controlled is assumed to be modeled as a set of some possible nondeterministic automata. Then, the control objective is to achieve a given language specification and guarantee the nonblockingness of any nondeterministic automata of the set which are controlled by a robust nonblocking supervisor. Based on trajectory models, this note presents the necessary and sufficient conditions for the existence of a robust nonblocking supervisor for a given uncertain nondeterministic DES     

Supervisory control of fuzzy discrete event systems: a formal approach.

Fuzzy discrete event systems (DESs) were proposed recently by Lin and Ying [19], which may better cope with the real-world problems of fuzziness, impreciseness, and subjectivity such as those in biomedicine. As a continuation of [19], in this paper, we further develop fuzzy DESs by dealing with supervisory control of fuzzy DESs. More specifically: 1) we reformulate the parallel composition of crisp DESs, and then define the parallel composition of fuzzy DESs that is equivalent to that in [19]. Max-product and max-min automata for modeling fuzzy DESs are considered, 2) we deal with a number of fundamental problems regarding supervisory control of fuzzy DESs, particularly demonstrate controllability theorem and nonblocking controllability theorem of fuzzy DESs, and thus, present the conditions for the existence of supervisors in fuzzy DESs; 3) we analyze the complexity for presenting a uniform criterion to test the fuzzy controllability condition of fuzzy DESs modeled by max-product automata; in particular, we present in detail a general computing method for checking whether or not the fuzzy controllability condition holds, if max-min automata are used to model fuzzy DESs, and by means of this method we can search for all possible fuzzy states reachable from initial fuzzy state in max-min automata. Also, we introduce the fuzzy n-controllability condition for some practical problems, and 4) a number of examples serving to illustrate the applications of the derived results and methods are described; some basic properties related to supervisory control of fuzzy DESs are investigated. To conclude, some related issues are raised for further consideration.     

A learning-based synthesis approach todecentralized supervisory control of discrete event systems with unknown plants

In this paper, we consider the problem of automatic synthesis of decentralized supervisor for uncertain discrete event systems. In particular, we study the case when the uncontrolled plant is unknown a priori. To deal with the unknown plants, we first characterize the conormality of prefix-closed regular languages and propose formulas for computing the supremal conormal sublanguages; then sufficient conditions for the existence of decentralized supervisors are given in terms of language controllability and conormality and a learning-based algorithm to synthesize the supervisor automatically is proposed. Moreover, the paper also studies the on-line decentralized supervisory control of concurrent discrete event systems that are composed of multiple interacting unknown modules. We use the concept of modular controllability to characterize the necessary and sufficient conditions for the existence of the local supervisors, which consist of a set of local supervisor modules, one for each plant module and which determines its control actions based on the locally observed behaviors, and an on-line learning-based local synthesis algorithm is also presented. The correctness and convergence of the proposed algorithms are proved, and their implementation are illustrated through examples.     

A New Class of Supervisors for Timed Discrete Event Systems Under Partial Observation

Brandin and Wonham have developed a supervisory control framework for timed discrete event systems (TDESs) in order to deal with not only logical specifications but also temporal specifications. Lin and Wonham have extended this framework to the partial observation case, and presented necessary and sufficient conditions for the existence of a nonblocking supervisor under partial observation. In this paper, we define a new class of supervisors for TDESs under partial observation. We then present necessary and sufficient conditions for the existence of a nonblocking supervisor defined in this paper. These existence conditions of our supervisor are weaker than those of Lin and Wonham's supervisor. Note, however, that the price that must be paid to weaken the existence conditions is the higher computational cost. Moreover, given a closed regular language, we study computation of a sublanguage that satisfies the existence conditions of our supervisor. We present an algorithm for computing such a sublanguage larger than the supremal closed, controllable, and normal sublanguage.     

New necessary and sufficient conditions for local controllability and local observability of 2-D separable denominator systems

New necessary and sufficient conditions for local controllability and observability of 2-D separable denominator systems (SDS's) are presented on the basis of the reduced-dimensional decomposition of 2-D SDS's. It is proved that local controllability of a 2-D SDS is equivalent to controllability of two 1-D systems which are a special decomposition pair of the 2-D SDS. Furthermore, local observability of a 2-D SDS is equivalent to a full rank condition of the coefficient matrices of the 2-D SDS in addition to observability of two 1-D systems which are another special decomposition pair of the 2-D SDS. Thus, these new conditions which use only 1-D controllability matrices, 1-D observability matrices, and coefficient matrices of the 2-D SDS are much simpler than any previous conditions which use complex 2-D controllability and observability matrices.