Download Free Supervisory Control Of Real Time Discrete Event Systems Book in PDF and EPUB Free Download. You can read online Supervisory Control Of Real Time Discrete Event Systems and write the review.

This book shows how supervisory control theory (SCT) supports the formulation of various control problems of standard types, like the synthesis of controlled dynamic invariants by state feedback, and the resolution of such problems in terms of naturally definable control-theoretic concepts and properties, like reachability, controllability and observability. It exploits a simple, abstract model of controlled discrete-event systems (DES) that has proved to be tractable, appealing to control specialists, and expressive of a range of control-theoretic ideas. It allows readers to choose between automaton-based and dually language-based forms of SCT, depending on whether their preference is for an internal-structural or external-behavioral description of the problem. The monograph begins with two chapters on algebraic and linguistic preliminaries and the fundamental concepts and results of SCT are introduced. To handle complexity caused by system scale, architectural approaches—the horizontal modularity of decentralized and distributed supervision and the vertical modularity of hierarchical supervision—are introduced. Supervisory control under partial observation and state-based supervisory control are also addressed; in the latter, a vector DES model that exploits internal regularity of algebraic structure is proposed. Finally SCT is generalized to deal with timed DES by incorporating temporal features in addition to logical ones. Researchers and graduate students working with the control of discrete-event systems or who are interested in the development of supervisory control methods will find this book an invaluable aid in their studies. The text will also be of assistance to researchers in manufacturing, logistics, communications and transportation, areas which provide plentiful examples of the class of systems being discussed.
Research of discrete event systems is strongly motivated by applications in flex ible manufacturing, in traffic control and in concurrent and real-time software verification and design, just to mention a few important areas. Discrete event system theory is a promising and dynamically developing area of both control theory and computer science. Discrete event systems are systems with non-numerically-valued states, inputs, and outputs. The approaches to the modelling and control of these systems can be roughly divided into two groups. The first group is concerned with the automatic design of controllers from formal specifications of logical requirements. This re search owes much to the pioneering work of P.J. Ramadge and W.M. Wonham at the beginning of the eighties. The second group deals with the analysis and op timization of system throughput, waiting time, and other performance measures for discrete event systems. The present book contains selected papers presented at the Joint Workshop on Discrete Event Systems (WODES'92) held in Prague, Czechoslovakia, on Au gust 26-28, 1992 and organized by the Institute of Information Theory and Au tomation of the Czechoslovak Academy of Sciences, Prague, Czechoslovakia, by the Automatic Control Laboratory of the Swiss Federal Institute of Technology (ETH) , Zurich, Switzerland, and by the Department of Computing Science of the University of Groningen, Groningen, the Netherlands.
Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application areas, linking the following topics in a coherent manner: language and automata theory, supervisory control, Petri net theory, Markov chains and queuing theory, discrete-event simulation, and concurrent estimation techniques. This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.
Approx. 484 pages
This book presents a methodology for the real-time scheduling problems of real-time systems (RTS) from the viewpoint of control theory. Generally, any system can be viewed as an RTS if it performs real-time application functions and behaves correctly depending on given logical activities and satisfying specified deadlines for the activities. This monograph provides broad views and detailed introductions to supervisory control theory (SCT) and its application in real-time scheduling and reconfiguration. Based on three popular SCT modelling frameworks, discrete-event system (DES), timed DES (TDES), and state-tree structures (STS), the authors provide RTS modelling frameworks; thereafter, SCT is used to find their safe execution sequences. As the main contribution, we use (untimed) DES events to represent the execution and preemption of each individual RTS task. This modelling formalism brings the possibilities to model the preemptions of tasks’ executions. Furthermore, in some cases, priorities cannot be assigned to real-time tasks. In order to solve this problem, a matrix-based priority-free conditional-preemption (PFCP) relation is provided, which generalizes fixed-priority (FP) RTS scheduling. As a natural extension, a generalized modular modelling framework is presented to model the task parameters instead of the global real-time task. The modular models are taken to be generic entities, which also considers the exact execution time of real-time tasks. STS are undoubtedly recognized as a computationally efficient SCT framework which manages the state explosion problem significantly. Hence, building on the (untimed) modular RTS models, a novel STS-based RTS modeling framework is formulated, by assigning dynamic priorities as specified optimality criteria, which can be utilized to model sporadic RTS processing both sporadic and (multi-period) periodic tasks, providing a small set of the safe execution sequences which rank at the top.
Supervisory Control of Discrete Event Systems Using Petri Nets presents a novel approach to its subject. The concepts of supervisory control and discrete event systems are explained, and the background material on general Petri net theory necessary for using the book's control techniques is provided. A large number of examples is used to illustrate the concepts and techniques presented in the text, and there are plenty of references for those interested in additional study or more information on a particular topic. Supervisory Control of Discrete Event Systems Using Petri Nets is intended for graduate students, advanced undergraduates, and practicing engineers who are interested in the control problems of manufacturing, communication and computer networks, chemical process plants, and other high-level control applications. The text is written from an engineering perspective, but it is also appropriate for students of computer science, applied mathematics, or economics. The book contains enough background material to stand alone as an introduction to supervisory control with Petri nets, but it may also be used as a supplemental text in a course on discrete event systems or intelligent autonomous control.
Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. Coverage ranges from introductory material on the basic notions and definitions of discrete-event systems to more recent results. Special attention is given to results on supervisory control, state estimation and fault diagnosis of both centralized and distributed/decentralized systems developed in the framework of the Distributed Supervisory Control of Large Plants (DISC) project. Later parts of the text are devoted to the study of congested systems though fluidization, an over approximation allowing a much more efficient study of observation and control problems of timed Petri nets. Finally, the max-plus algebraic approach to the analysis and control of choice-free systems is also considered. Control of Discrete-event Systems provides an introduction to discrete-event systems for readers that are not familiar with this class of systems, but also provides an introduction to research problems and open issues of current interest to readers already familiar with them. Most of the material in this book has been presented during a Ph.D. school held in Cagliari, Italy, in June 2011.
This monograph presents a systematic top-down approach to distributed control synthesis of discrete-event systems (DES). The approach is called supervisor localization; its essence is the allocation of external supervisory control action to individual component agents as their internal control strategies. The procedure is: first synthesize a monolithic supervisor, to achieve globally optimal and nonblocking controlled behavior, then decompose the monolithic supervisor into local controllers, one for each agent. The collective behavior of the resulting local controllers is identical to that achieved by the monolithic supervisor. The basic localization theory is first presented in the Ramadge–Wonham language-based supervisory control framework, then demonstrated with distributed control examples of multi-robot formations, manufacturing systems, and distributed algorithms. An architectural approach is adopted to apply localization to large-scale DES; this yields a heterarchical localization procedure, which is also demonstrated with benchmark examples. Moreover, a state-based framework, state-tree structures, is exploited for efficient computation of localization. Finally localization is extended to timed DES, which addresses distributed control synthesis with temporal specifications. The authors’ TCT software and sourcecode will help the reader to reproduce the results demonstrated in the examples. Academic researchers and graduate students interested in discrete-event and distributed systems and control will find this book an instructive resource. It will also be useful for researchers in manufacturing, supply-chain and logistics and practitioners in related industries.
Supervisory Control Theory (SCT) provides a tool to model and control human-engineered complex systems, such as computer networks, World Wide Web, identification and spread of malicious executables, and command, control, communication, and information systems. Although there are some excellent monographs and books on SCT to control and diagnose discrete-event systems, there is a need for a research monograph that provides a coherent quantitative treatment of SCT theory for decision and control of complex systems. This new monograph will assimilate many new concepts that have been recently reported or are in the process of being reported in open literature. The major objectives here are to present a) a quantitative approach, supported by a formal theory, for discrete-event decision and control of human-engineered complex systems; and b) a set of applications to emerging technological areas such as control of software systems, malicious executables, and complex engineering systems. The monograph will provide the necessary background materials in automata theory and languages for supervisory control. It will introduce a new paradigm of language measure to quantitatively compare the performance of different automata models of a physical system. A novel feature of this approach is to generate discrete-event robust optimal decision and control algorithms for both military and commercial systems.
This book constitutes the thoroughly refereed papers of the 15th International Conference on Implementation and Application of Automata, CIAA 2010, held in Manitoba, Winnipeg, Canada, in August 2010. The 26 revised full papers together with 6 short papers were carefully selected from 52 submissions. The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; bioinformatics; algebra; graph theory; and foundational work on automata theory.