Search

This book focuses on the basic control and filtering synthesis problems for discrete-time switched linear systems under time-dependent switching signals. Chapter 1, as an introduction of the book, gives the backgrounds and motivations of switched systems, the definitions of the typical time-dependent switching signals, the differences and links to other types of systems with hybrid characteristics and a literature review mainly on the control and filtering for the underlying systems. By summarizing the multiple Lyapunov-like functions (MLFs) approach in which different requirements on comparisons of Lyapunov function values at switching instants, a series of methodologies are developed for the issues on stability and stabilization, and l2-gain performance or tube-based robustness for l∞ disturbance, respectively, in Chapters 2 and 3. Chapters 4 and 5 are devoted to the control and filtering problems for the time-dependent switched linear systems with either polytopic uncertainties or measurable time-varying parameters in different sense of disturbances. The asynchronous switching problem, where there is time lag between the switching of the currently activated system mode and the controller/filter to be designed, is investigated in Chapter 6. The systems with various time delays under typical time-dependent switching signals are addressed in Chapter 7.

Switched linear systems have enjoyed a particular growth in interest since the 1990s. The large amount of data and ideas thus generated have, until now, lacked a co-ordinating framework to focus them effectively on some of the fundamental issues such as the problems of robust stabilizing switching design, feedback stabilization and optimal switching. This deficiency is resolved by this book which features: nucleus of constructive design approaches based on canonical decomposition and forming a sound basis for the systematic treatment of secondary results; theoretical exploration and logical association of several independent but pivotal concerns in control design as they pertain to switched linear systems: controllability and observability, feedback stabilization, optimization and periodic switching; a reliable foundation for further theoretical research as well as design guidance for real life engineering applications through the integration of novel ideas, fresh insights and rigorous results.

Applied Automata Theory provides an engineering style of presentation of some of the applied work in the field of automata theory. Topics covered range from algebraic foundations and recursive functions to regular expressions, threshold logic, and switching circuits. Coding problems and stochastic processes are also discussed, along with content addressable memories, probabilistic reliability, and Turing machines. Much emphasis is placed on engineering applications. Comprised of nine chapters, this book first deals with the algebraic foundations of automata theory, focusing on concepts such as semigroups, groups and homomorphisms, and partially ordered sets and lattices, as well as congruences and other relations. The reader is then introduced to regular expressions; stochastic automata and discrete systems theory; and switching networks as models of discrete stochastic processes. Subsequent chapters explore applications of automata theory in coding; content addressable and distributed logic memories; recursive functions and switching-circuit theory; and synthesis of a cellular computer. The book concludes with an assessment of the fundamentals of threshold logic. This monograph is intended for graduates or advanced undergraduates taking a course in information science or a course on discrete systems in modern engineering curriculum.

Network and Switching Theory

Network and Switching Theory