Abstract
Abstract In this paper discrete manufacturing processes are modelled by finite Boolean automata. Different from classical automata theory, however, an arithmetic state space notation is used such as to provide a close relationship to classical discrete-time control. A case study will focus on observer-based control and its potential for fault management.
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.
