Abstract
Symbolic models of continuous and hybrid systems have been studied for a long time, because they provide a formal approach to solve control problems where software and hardware interact with the physical world. While being powerful, this approach often encounters some limitations in concrete applications, because of the large size of the symbolic models needed to be constructed. Inspired by on-the-fly techniques for verification and control of finite state machines, in this note we propose an algorithm that integrates the construction of the symbolic models with the design of the symbolic controllers. Computational complexity of the proposed algorithm is discussed and an illustrative example is included.
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.
