Discrete Control of Continuous Processes.
Abstract
Canonical realization and synthesis of synchronous coders (mappings of real-valued input sequences to discrete-valued output sequences) have been achieved. Equivalent characterization of such coders as mappings, hybrid automata and real language acceptors have been established. Practical device synthesis procedures have been given for a significant class of such mappings. Regularity results have been developed for more general classes of coders. Algorithms for control design of synchronous systems with piecewise-continuous transition mappings, which employ new aggregation results along with the foregoing synthesis results have been derived. Unlike previous methods, these algorithms encompass coder/decoder specification and produce designs which are directly implementable as automata. Preliminary results have been obtained for asynchronous coders and controllers. It has been shown that a certain class of asynchronous multitasking systems admit realization as hybrid synchronous systems and are hence amenable to the methods of analysis developed for synchronous control systems. The concepts employed for synchronous coders may be generalized to the asynchronous case, but the specific form of the results differs. Qualitative properties of a class of piecewise-constant systems have been established. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1981
- Accession Number
- ADA113839
Entities
People
- Martin E. Kaliski
- Timothy L. Johnson
Organizations
- Massachusetts Institute of Technology