Abstract
In this paper we show that incrementally stable nonlinear time-delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, to the original system. An algorithm is presented which computes the proposed symbolic models. Termination of the algorithm in a finite number of steps is guaranteed by a boundedness assumption on the sets of states and inputs of the system.
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.
