Skip to main content
Top

1995 | Book

Modeling and Control of Logical Discrete Event Systems

Authors: Ratnesh Kumar, Vijay K. Garg

Publisher: Springer US

Book Series : The International Series in Engineering and Computer Science

insite
SEARCH

About this book

The field of discrete event systems has emerged to provide a formal treatment of many of the man-made systems such as manufacturing systems, communica­ tion networks. automated traffic systems, database management systems, and computer systems that are event-driven, highly complex, and not amenable to the classical treatments based on differential or difference equations. Discrete event systems is a growing field that utilizes many interesting mathematical models and techniques. In this book we focus on a high level treatment of discrete event systems. where the order of events. rather than their occurrence times, is the principal concern. Such treatment is needed to guarantee that the system under study meets desired logical goals. In this framework, dis­ crete event systems are modeled by formal languages or, equivalently, by state machines. The field of logical discrete event systems is an interdisciplinary field-it in­ cludes ideas from computer science, control theory, and operations research. Our goal is to bring together in one book the relevant techniques from these fields. This is the first book of this kind, and our hope is that it will be useful to professionals in the area of discrete event systems since most of the material presented has appeared previously only in journals. The book is also designed for a graduate level course on logical discrete event systems. It contains all the necessary background material in formal language theory and lattice the­ ory. The only prerequisite is some degree of "mathematical maturity".

Table of Contents

Frontmatter
1. Introduction to Formal Language Theory
Abstract
In this chapter we review concepts from formal language theory which form a basis for the supervisory control theory initiated by Ramadge and Wonham, and subsequently extended by other researchers. A familiarity with basic set theoretic notions is assumed.
Ratnesh Kumar, Vijay K. Garg
2. Introduction to Lattice Theory
Abstract
In this chapter we introduce the notion of lattices and obtain techniques for obtaining extremal solutions of inequations involving operations over lattices. Our motivation for studying these concepts and techniques stems from our interest in solving a system of inequations involving operations over the lattice of languages. Results presented in this chapter have a “primal” and a “dual” version. We only prove the primal version, as the dual version can be proved analogously.
Ratnesh Kumar, Vijay K. Garg
3. Control under Complete Observation
Abstract
In this chapter, we present the supervisory control theory of discrete event systems under complete observation of events. The theory is applicable in any general setting of languages; however, for the termination of algorithms it is required that the languages be regular.
Ratnesh Kumar, Vijay K. Garg
4. Control under Partial Observation
Abstract
In this chapter, we extend the supervisory control theory of discrete event systems to the setting of partial observation of events—such partial observation naturally arises when there is an insufficient number of sensors. Both centralized and decentralized control techniques are studied.
Ratnesh Kumar, Vijay K. Garg
5. Control of Non-Terminating Behavior
Abstract
So far we have restricted our attention to behaviors consisting of finite length strings. Such behaviors are useful in describing safety properties of a system, i.e., those properties which state that some conditions must never occur. In this chapter we will study supervisory control of behaviors consisting of infinite length strings. Such behaviors are useful in describing progress properties of a system, i.e., those properties which state that some conditions must occur eventually. In general it is not possible to express such progress constraints as constraints on finite length strings. Consider for example a communication system in which every transmitted message must be received eventually. Since each finite length trace of the communication system can be extended in a manner such that the above constraint is satisfied, this constraint does not impose any restriction on finite length traces of the communication system. However, it is clear that it imposes restriction on traces of infinite length. Thus there is a need to separately study issues related to behaviors consisting of infinite length strings, or non-terminating behaviors. Such behaviors are represented using ω-languages. In order to avoid any confusion, we use the term *-language to denote a set of finite length strings.
Ratnesh Kumar, Vijay K. Garg
Backmatter
Metadata
Title
Modeling and Control of Logical Discrete Event Systems
Authors
Ratnesh Kumar
Vijay K. Garg
Copyright Year
1995
Publisher
Springer US
Electronic ISBN
978-1-4615-2217-1
Print ISBN
978-1-4613-5931-9
DOI
https://doi.org/10.1007/978-1-4615-2217-1