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.
Symbolic Models for Nonlinear Time-Delay Systems Using Approximate Bisimulations
POLA, GIORDANO;PEPE, PIERDOMENICO;DI BENEDETTO, MARIA DOMENICA;
2010-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.