Approximate bisimulation relations for constrained linear systems

Abstract : In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems are and remain identical, approximate bisimulation allows the observations to be different provided the distance between them remains bounded by some parameter called precision. Approximate bisimulation relations are conveniently defined as level sets of a so-called bisimulation function which can be characterized using Lyapunov-like differential inequalities. For a class of constrained linear systems, we develop computationally effective characterizations of bisimulation functions that can be interpreted in terms of linear matrix inequalities and optimal values of static games. We derive a method to evaluate the precision of the approximate bisimulation relation between a constrained linear system and its projection. This method has been implemented in a Matlab toolbox: MATISSE. An example of use of the toolbox in the context of safety verification is shown.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00171420
Contributor : Brigitte Bidegaray-Fesquet <>
Submitted on : Wednesday, September 12, 2007 - 1:30:07 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text

Identifiers

Collections

Citation

Antoine Girard, George J. Pappas. Approximate bisimulation relations for constrained linear systems. Automatica, Elsevier, 2007, 43 (8), pp.1307-1317. ⟨10.1016/j.automatica.2007.01.019⟩. ⟨hal-00171420⟩

Share

Metrics

Record views

349