Approximately bisimilar finite abstractions of stable linear systems

Antoine Girard 1
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Antoine Girard <>
Submitted on : Monday, July 28, 2008 - 5:09:55 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text




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⟩



Record views