Supervisory Control of Fuzzy Discrete Event Systems

In order to cope with situations in which a plant's dynamics are not precisely known, we consider the problem of supervisory control for a class of discrete event systems modelled by fuzzy automata. The behavior of such discrete event systems is described by fuzzy languages; the supervisors are event feedback and can disable only controllable events with any degree. The concept of discrete event system controllability is thus extended by incorporating fuzziness. In this new sense, we present a necessary and sufficient condition for a fuzzy language to be controllable. We also study the supremal controllable fuzzy sublanguage and the infimal controllable fuzzy superlanguage when a given pre-specified desired fuzzy language is uncontrollable. Our framework generalizes that of Ramadge-Wonham and reduces to Ramadge-Wonham framework when membership grades in all fuzzy languages must be either 0 or 1. The theoretical development is accompanied by illustrative numerical examples.Comment: 12 pages, 2 figure

Retraction and Generalized Extension of Computing with Words

Fuzzy automata, whose input alphabet is a set of numbers or symbols, are a formal model of computing with values. Motivated by Zadeh's paradigm of computing with words rather than numbers, Ying proposed a kind of fuzzy automata, whose input alphabet consists of all fuzzy subsets of a set of symbols, as a formal model of computing with all words. In this paper, we introduce a somewhat general formal model of computing with (some special) words. The new features of the model are that the input alphabet only comprises some (not necessarily all) fuzzy subsets of a set of symbols and the fuzzy transition function can be specified arbitrarily. By employing the methodology of fuzzy control, we establish a retraction principle from computing with words to computing with values for handling crisp inputs and a generalized extension principle from computing with words to computing with all words for handling fuzzy inputs. These principles show that computing with values and computing with all words can be respectively implemented by computing with words. Some algebraic properties of retractions and generalized extensions are addressed as well.Comment: 13 double column pages; 3 figures; to be published in the IEEE Transactions on Fuzzy System

A Fuzzy Petri Nets Model for Computing With Words

Motivated by Zadeh's paradigm of computing with words rather than numbers, several formal models of computing with words have recently been proposed. These models are based on automata and thus are not well-suited for concurrent computing. In this paper, we incorporate the well-known model of concurrent computing, Petri nets, together with fuzzy set theory and thereby establish a concurrency model of computing with words--fuzzy Petri nets for computing with words (FPNCWs). The new feature of such fuzzy Petri nets is that the labels of transitions are some special words modeled by fuzzy sets. By employing the methodology of fuzzy reasoning, we give a faithful extension of an FPNCW which makes it possible for computing with more words. The language expressiveness of the two formal models of computing with words, fuzzy automata for computing with words and FPNCWs, is compared as well. A few small examples are provided to illustrate the theoretical development.Comment: double columns 14 pages, 8 figure

Detectability Of Fuzzy Discrete Event Systems

Dynamic systems that can be modeled in terms of discrete states and a synchronous events are known as discrete event systems (DES). A DES is defined in terms of states, events, transition dynamics, and initial state. Knowing the system’s state is crucial in many applications for certain actions (events) to be taken. A DES system is considered a fuzzy discrete event system (FDES) if its states and events are vague in nature; for such systems, the system can be in more than one state at the same time with different degrees of possibility (membership). In this research we introduce a fuzzy discrete event system with constraints (FDESwC) and investigate its detectabilities. This research aims to address the gap in previous studies and extend existing definitions of detectability of DES to include the detectability in systems with substantial vagueness such as FDES. These definitions are first reformulated to introduce N-detectability for DES, which are further extended to define four main types of detectabilities for FDES: strong N-detectability, (weak) N-detectability, strong periodic N-detectability, and (weak) periodic N-detectability. We first partition the FDES into trajectories of a length dictated by the depth of the event’s string (length of the event sequence); each trajectory consists of a number of nodes, which are further investigated for detectability by examining them against the newly introduced certainty criterion. Matrix computation algorithms and fuzzy logic operations are adopted to calculate the state estimates based on the current state and the occurring events. Vehicle dynamics control example is used to demonstrate the practical aspect of developed theorems in real-world applications

Application of a continuous supervisory fuzzy control on a discrete scheduling of manufacturing systems.

10 pagesInternational audienceThis paper considers the modelling and simulation of a hierarchical production-flow control system. Particularly, the system capacity allocation has been addressed by a set of distributed and supervised fuzzy controllers. The objective is to adjust the machine's production rates in such a way that satisfies the demand while maintaining the overall performances within acceptable limits. Given the adjusted production rates, the problem of scheduling of jobs is considered at the shop-floor level. In this case, the actual dispatching times are determined from the continuous production rates through a sampling procedure. To deal with conflicts between jobs at a shared machine, a decision for the actual part to be processed is taken using some criteria which represent a measure of the job's priority. A case study demonstrates the efficiency of the proposed control approach

RULES BASED MODELING OF DISCRETE EVENT SYSTEMS WITH FAULTS AND THEIR DIAGNOSIS

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete event systems, Sampath et al. proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete event systems and gave a method for testing the diagnosability by first constructing a diagnoser for the system. The complexity of this method of testing diagnosability is exponential in the number of states of the system and doubly exponential in the number of failure types. In this thesis, we give an algorithm for testing diagnosability that does not construct a diagnoser for the system, and its complexity is of 4th order in the number of states of the system and linear in the number of the failure types. In this dissertation we also study diagnosis of discrete event systems (DESs) modeled in the rule-based modeling formalism introduced in [12] to model failure-prone systems. The results have been represented in [43]. An attractive feature of rule-based model is it\u27s compactness (size is polynomial in number of signals). A motivation for the work presented is to develop failure diagnosis techniques that are able to exploit this compactness. In this regard, we develop symbolic techniques for testing diagnosability and computing a diagnoser. Diagnosability test is shown to be an instance of 1st order temporal logic model-checking. An on-line algorithm for diagnosersynthesis is obtained by using predicates and predicate transformers. We demonstrate our approach by applying it to modeling and diagnosis of a part of the assembly-line. When the system is found to be not diagnosable, we use sensor refinement and sensor augmentation to make the system diagnosable. In this dissertation, a controller is also extracted from the maximally permissive supervisor for the purpose of implementing the control by selecting, when possible, only one controllable event from among the ones allowed by the supervisor for the assembly line in automaton models

Intelligent Integrated Management for Telecommunication Networks

As the size of communication networks keeps on growing, faster connections, cooperating technologies and the divergence of equipment and data communications, the management of the resulting networks gets additional important and time-critical. More advanced tools are needed to support this activity. In this article we describe the design and implementation of a management platform using Artificial Intelligent reasoning technique. For this goal we make use of an expert system. This study focuses on an intelligent framework and a language for formalizing knowledge management descriptions and combining them with existing OSI management model. We propose a new paradigm where the intelligent network management is integrated into the conceptual repository of management information called Managed Information Base (MIB). This paper outlines the development of an expert system prototype based in our propose GDMO+ standard and describes the most important facets, advantages and drawbacks that were found after prototyping our proposal

Approximate Controllability of Semi-linear Fuzzy Dynamical System

In this paper we consider a semi-linear dynamical system with fuzzy initial condition. We discuss the results regarding the approximate controllability of the system and existence of the controller which steers the system to the desired state. The theory is substantiated with an illustrative example

Modeling and control of complex dynamic systems: Applied mathematical aspects

The concept of complex dynamic systems arises in many varieties, including the areas of energy generation, storage and distribution, ecosystems, gene regulation and health delivery, safety and security systems, telecommunications, transportation networks, and the rapidly emerging research topics seeking to understand and analyse. Such systems are often concurrent and distributed, because they have to react to various kinds of events, signals, and conditions. They may be characterized by a system with uncertainties, time delays, stochastic perturbations, hybrid dynamics, distributed dynamics, chaotic dynamics, and a large number of algebraic loops. This special issue provides a platform for researchers to report their recent results on various mathematical methods and techniques for modelling and control of complex dynamic systems and identifying critical issues and challenges for future investigation in this field. This special issue amazingly attracted one-hundred-and eighteen submissions, and twenty-eight of them are selected through a rigorous review procedure