Symbolic models for nonlinear time-delay systems using approximate bisimulations

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.