2006Unpublished venueOpen access

Approximate Bisimulations for Nonlinear Dynamical Systems

Antoine Girard, George J. Pappas

Open full text 97 citations

Abstract

The notion of exact bisimulation equivalence for nondeterministic discrete systems has recently resulted in notions of exact bisimulation equivalence for continuous and hybrid systems. In this paper, we establish the more robust notion of approximate bisimulation equivalence for nondeterministic nonlinear systems. This is achieved by requiring that a distance between system observations starts and remains, close, in the presence of nondeterministic system evolution. We show that approximate bisimulation relations can be characterized using a class of functions called bisimulation functions. For nondeterministic nonlinear systems, we show that conditions for the existence of bisimulation functions can be expressed in terms of Lyapunov-like inequalities, which for deterministic systems can be computed using recent sum-of-squares techniques. Our framework is illustrated on a safety verification example.

Open-access reader

About this research paper

What this paper is about

The notion of exact bisimulation equivalence for nondeterministic discrete systems has recently resulted in notions of exact bisimulation equivalence for continuous and hybrid systems. In this paper, we establish the more robust notion of approximate bisimulation equivalence for nondeterministic nonlinear systems. This is achieved by requiring that a distance between system observations starts and remains, close, in the presence of nondeterministic system evolution. We show that approximate bisimulation relations can be characterized using a class of functions called bisimulation functions. For nondeterministic nonlinear systems, we show that conditions for the existence of bisimulation functions can be expressed in terms of Lyapunov-like inequalities, which for deterministic systems can be computed using recent sum-of-squares techniques. Our framework is illustrated on a safety verification example.

Why it matters

OpenAlex reports 97 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The notion of exact bisimulation equivalence for nondeterministic discrete systems has recently resulted in notions of exact bisimulation equivalence for continuous and hybrid systems. In this paper, we establish the more robust notion of approximate bisimulation equivalence for nondeterministic nonlinear systems. This is achieved by requiring that a distance between system observations starts and remains, close, in the presence of nondeterministic system evolution. We show that approximate bisimulation relations can be characterized using a class of functions called bisimulation functions. For nondeterministic nonlinear systems, we show that conditions for the existence of bisimulation functions can be expressed in terms of Lyapunov-like inequalities, which for deterministic systems can be computed using recent sum-of-squares techniques. Our framework is illustrated on a safety verification example.

Key concepts: Bisimulation, Nondeterministic algorithm, Equivalence (formal languages), Nonlinear system, Mathematics, Dynamical systems theory, Discrete mathematics, Algebra over a field

Related papers

Back to paper searchBrowse research topicsOriginal source
Approximate Bisimulations for Nonlinear Dynamical Systems — Research Paper | ScholarLens