Skip to main content
Approximation Metrics for Discrete and Continuous Systems
Departmental Papers (CIS)
  • Antoine Girard, University of Pennsylvania
  • George J Pappas, University of Pennsylvania
Date of this Version
Document Type
Journal Article
Copyright 2007 IEEE. Reprinted from IEEE Transactions on Automatic Control, Volume 52, Issue 5, May 2007, pages 782-798.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Established system relationships for discrete systems, such as language inclusion, simulation, and bisimulation, require system observations to be identical. When interacting with the physical world, modeled by continuous or hybrid systems, exact relationships are restrictive and not robust. In this paper, we develop the first framework of system approximation that applies to both discrete and continuous systems by developing notions of approximate language inclusion, approximate simulation, and approximate bisimulation relations. We define a hierarchy of approximation pseudo-metrics between two systems that quantify the quality of the approximation, and capture the established exact relationships as zero sections. Our approximation framework is compositional for a synchronous composition operator. Algorithms are developed for computing the proposed pseudo-metrics, both exactly and approximately. The exact algorithms require the generalization of the fixed point algorithms for computing simulation and bisimulation relations, or dually, the solution of a static game whose cost is the so-called branching distance between the systems. Approximations for the pseudo-metrics can be obtained by considering Lyapunov-like functions called simulation and bisimulation functions. We illustrate our approximation framework in reducing the complexity of safety verification problems for both deterministic and nondeterministic continuous systems.

  • abstraction,
  • approximation,
  • bisimulation,
  • metrics,
  • transition systems
Citation Information
Antoine Girard and George J Pappas. "Approximation Metrics for Discrete and Continuous Systems" (2007)
Available at: