Abstract
The paper addresses technical processes which can be modelled by Boolean finite state machines. Different from classical automata theory, an arithmetic notation of Boolean functions is used based on multilinear polynomials. An example of observer-based task oriented feedback control of a transportation process is discussed in the paper. Fault detection in this discrete-event dynamical system is achieved via non-binary coding of forbidden states.
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.
