Abstract
Publisher Summary This chapter describes a framework for modeling discrete event systems for automated manufacturing processes. A discrete event system can be formalized as finite-state automata in terms of input, output, and state spaces; a state transition function; and an output map. This line of approach does not lead to computationally attractive tools for state estimation or control because of the need for examining a large number of input sequence state-variable value pairs. By transforming a Boolean algebraic representation of discrete event system into a Boolean calculus framework and imposing suitable relations on the input, output, and state space, computational problems of a discrete event state estimation and control may be reduced. Given certain assumptions about the occurrence of exogenous events and the determinism of the system, resulting computational problems of state evolution are simplified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
