Approximately bisimilar finite abstractions of stable linear systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Approximately bisimilar finite abstractions of stable linear systems

Résumé

The use of bisimilar finite abstractions of continuous and hybrid systems, greatly simplifies complex computational tasks such as verification or control synthesis. Unfortunately, because of the strong requirements of bisimulation relations, such abstractions exist only for quite restrictive classes of systems. Recently, the notion of approximate bisimulation relations has been introduced, allowing the definition of less rigid relationships between systems. This relaxed notion should certainly allow us to build approximately bisimilar finite abstractions for more general classes of continuous and hybrid systems. In this paper, we show that for the class of stable discrete-time linear systems with constrained inputs, there exists an approximately bisimilar finite state system of any desired precision. We describe an effective procedure for the construction of this abstraction, based on compositional reasoning and samples of the set of initial states and inputs. Finally, we briefly show how our finite abstractions can be used for verification or control synthesis.

Dates et versions

hal-00306999 , version 1 (28-07-2008)

Identifiants

Citer

Antoine Girard. Approximately bisimilar finite abstractions of stable linear systems. HSCC 2007 - Hybrid Systems: Computation and Control, Apr 2007, Pisa, Italy. pp.231-244, ⟨10.1007/978-3-540-71493-4_20⟩. ⟨hal-00306999⟩
160 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More