Approximate Bisimulation: A Bridge Between Computer Science and Control Theory

Abstract : Fifty years ago, control and computing were part of a broader system science. After a long period of separate development within each discipline, embedded and hybrid systems have challenged us to reunite the, now sophisticated theories of continuous control and discrete computing on a broader system theoretic basis. In this paper, we present a framework of system approximation that applies to both discrete and continuous systems. We define a hierarchy of approximation metrics between two systems that quantify the quality of the approximation, and capture the established notions in computer science as zero sections. The central notions in this framework are that of approximate simulation and bisimulation relations and their functional characterizations called simulation and bisimulation functions and defined by Lyapunov-type inequalities. In particular, these functions can provide computable upper-bounds on the approximation metrics by solving a static game. Our approximation framework will be illustrated by showing some of its applications in various problems such as reachability analysis of continuous systems and hybrid systems, approximation of continuous and hybrid systems by discrete systems, hierarchical control design, and simulation-based approaches to verification of continuous and hybrid systems.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00765660
Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Saturday, December 15, 2012 - 9:07:58 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: A Bridge Between Computer Science and Control Theory. European Journal of Control, Lavoisier, 2011, 17 (5-6), pp.568-578. ⟨10.3166/ejc.17.568-578⟩. ⟨hal-00765660⟩

Share

Metrics

Record views

334