Approximate Bisimulation Relations for Constrained Linear Systems

Loading...
Thumbnail Image
Penn collection
Departmental Papers (ESE)
General Robotics, Automation, Sensing and Perception Laboratory
Degree type
Discipline
Subject
GRASP
abstractions
approximation
bisimulation
lyapunov techniques
safety
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Girard, Antoine
Contributor
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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2007-08-01
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Postprint version. Published in Automatica, Volume 43, Issue 8, August 2007, 1307-1317. Publisher URL: http://dx.doi.org/10.1016/j.automatica.2007.01.019
Recommended citation
Collection