The third edition of Introduction to Discrete Event Systems is available as both a print copy and an e-book with hyperlinking capability. We hope the readers will appreciate this new option.The third edition is a "superset" of the second one, with new material added principally in Chaps. 1, 2, 3, 5, 10, and 11. These additions are based on our teaching of discrete event systems courses at Boston University and at the University of Michigan, and they reflect active research trends in discrete event systems since the publication of the second edition. The additions consist of the inclusion of new topics as well as more thorough coverage of existing topics. For the benefit of readers familiar with the second edition, the main changes are summarized as follows.Ä Chapter 1: additional examples of discrete event systems and more discussion on modeling.Ä Chapter 2: new sections on opacity properties, labeled transitions systems, and formal verification and temporal logic; enhanced treatment of verification of diagnosability and codiagnosability properties, state space refinement, and strict subautomata; additional end-of-chapter problems.Ä Chapter 3: new sections on state-based and liveness specifications, marking in specifications, maximal controllable and observable sublanguages, and marking supervisors; expanded treatment of control under partial observation, including state partition automata, supremal normal and controllable sublanguage, inf imal observable and controllable superlanguage, and safe supervisors; more detailed treatment of verification of coobservability in decentralized control and safe decentralized supervision; additional end-of-chapter problems.Ä Chapter 5: new section on event diagnosis.Ä Chapter 10: updated section on discrete event simulation languages.Ä Chapter 11: updated sections on extensions of IPA and on concurrent estimation.While end-of-chapter references have been updated to reflect the new material included, we emphasize once again that these sections serve primarily as starting points for additional readings. The literature in discrete event systems is now vast and diverse, reflecting the growth in this f ield in the last 30 years.vii Once again, we sincerely thank our colleagues, students, and readers for their constructive feedback over the last 12 years. We have tried to account for their comments in this third edition, but obviously our coverage of the growing field of discrete event systems is still very much incomplete. Nevertheless, we hope this book will continue to serve as a comprehensive introduction to the important class of dynamical systems known as discrete event systems. Several additional resources as well as software tools are mentioned throughout the book, although we have avoided explicit listings of URLs, since these tend to change frequently; however, the desired resources should be easily located by web searches.Finally, it is a pleasure to acknowledge the leadership of Melissa Fearon and Wayne Wheeler at Springer throughout the course of this project.Boston, USA
We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be``fused'' using both union and intersection of enabled events. Namely, the supervisors agree a priori on choosing``fusion by union'' for certain controllable events and``fusion by intersection'' for certain other controllable events. We show that under this architecture, a larger class of languages can be achieved than before since a relaxed version of the notion of co-observability appears in the necessary and suf®cient conditions for the existence of supervisors. The computational complexity of verifying these new conditions is studied. A method of partitioning the controllable events between``fusion by union'' and``fusion by intersection'' is presented. The algebraic properties of co-observability in the context of this architecture are presented. We show that appropriate combinations of fusion rules with corresponding decoupled local decision rules guarantee the safety of the closed-loop behavior with respect to a given speci®cation that is not co-observable. We characterize an``optimal'' combination of fusion rules among those combinations guaranteeing the safety of the closed-loop behavior. In addition, a simple supervisor synthesis technique generating the in®mal pre®x-closed controllable and co-observable superlanguage is presented.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.