Fixed point iteration for computing the time elapse operator

  • Authors:

  • Sriram Sankaranarayanan;Henny B. Sipma;Zohar Manna

  • Affiliations:

  • NEC Laboratories America, Princeton, NJ;Computer Science Department, Stanford University;Computer Science Department, Stanford University

  • Venue:
  • HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate techniques for automatically generating symbolic approximations to the time solution of a system of differential equations. This is an important primitive operation for the safety analysis of continuous and hybrid systems. In this paper we design a time elapse operator that computes a symbolic over-approximation of time solutions to a continuous system starting from a given initial region. Our approach is iterative over the cone of functions (drawn from a suitable universe) that are non negative over the initial region. At each stage, we iteratively remove functions from the cone whose Lie derivatives do not lie inside the current iterate. If the iteration converges, the set of states defined by the final iterate is shown to contain all the time successors of the initial region. The convergence of the iteration can be forced using abstract interpretation operations such as widening and narrowing. We instantiate our technique to linear hybrid systems with piecewise-affine dynamics to compute polyhedral approximations to the time successors. Using our prototype implementation TimePass, we demonstrate the performance of our technique on benchmark examples.