Abstract
Composite asynchronous sequential machines (ASMs) are studied by a matrix-based approach in this study. A composite ASM consists of several input/state asynchronous machines in a cascading fashion. By using the semi-tensor product method, the algebraic expression of composite ASMs is presented, based on which reachability of composite ASMs is investigated. Then, a necessary and sufficient condition for the existence of a controller for model matching is obtained and an algorithm to design the corresponding controller is established. Finally, an example is proposed to illustrate the effectiveness of the obtained results.
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.
