Integrating projections

  • Mark R. Greenstreet
  • Ian Mitchell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1386)


This paper describes three techniques for reachability analysis for systems modeled by ordinary differential equations (ODES). First, linear models with regions modeled by convex polyhedra are considered, and an exact algorithm is presented. Next, non-convex polyhedra are considered, and techniques are presented for representing a polyhedron by its projection onto two-dimensional subspaces. This approach yields a compact representation, and allows efficient algorithms from computational geometry to be employed. Within this context, an approximation technique for reducing non-linear ODE models to linear nonhomogeneous models is presented. This reduction provides a sound basis for applying methods for linear systems analysis to non-linear systems.


Convex Polyhedron Reachability Analysis Convex Approximation Verification Problem Transistor Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AF92]
    D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Computational Geometry, 8:295–313, 1992.Google Scholar
  2. [Apo67]
    Thomas M. Apostle. Calculus, volume 1. John Wiley and Sons, Inc., New York, second edition, 1967.Google Scholar
  3. [Bak90]
    H.B. Bakoglu. Circuits, Interconnections, and Packaging for VLSI. Addison-Wesley, 1990.Google Scholar
  4. [Bro89]
    R. W. Brockett. Smooth dynamical systems which realize arithmetical and logical operations. In Hendrik Nijmeijer and Johannes M. Schumacher, editors, Three Decades of Mathematical Systems Theory: A Collection of Surveys at the Occasion of the 50th Birthday of J. C. Willems, volume 135 of Lecture Notes in Control and Information Sciences pages 19–30. Springer, 1989.Google Scholar
  5. [GD85]
    Lance A. Glasser and Daniel W. Dobberpuhl. The Design and Analysis of VLSI Circuits. Addison-Wesley, 1985.Google Scholar
  6. [GM97]
    Mark R. Greenstreet and Ian Mitchell. Reachability with discrete and ODE models. In Michael Lemmon, editor, Fifth International Hybrid System Workshop, Notre Dame, September 1997.Google Scholar
  7. [Gre96]
    Mark R. Greenstreet. Verifying safety properties of differential equations. In Proceedings of the 1996 Conference on Computer Aided Verification, pages 277–287, New Brunswick, NJ, July 1996.Google Scholar
  8. [HH95]
    T.A. Henzinger and P.-H. Ho. HYTECH: The Cornell Hybrid Technology Tool. In P. Antsaklis, A. Nerode, W. Kohn, and S. Sastry, editors, Hybrid Systems II, Lecture Notes in Computer Science 999, pages 265–293. Springer-Verlag, 1995.Google Scholar
  9. [HS74]
    Morris W. Hirsch and Stephen Smale. Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, San Diego, CA, 1974.Google Scholar
  10. [Nag75]
    L.W. Nagel. SPICE2: a computer program to simulate semiconductor circuits. Technical Report ERL-M520, Electronics Research Laboratory, University of California, Berkeley, CA, May 1975.Google Scholar
  11. [PS82]
    Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ, 1982.Google Scholar
  12. [PS85]
    Franco P. Preparata and Michael I. Shamos. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Mark R. Greenstreet
    • 1
  • Ian Mitchell
    • 2
  1. 1.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada
  2. 2.Scientific Computing and Computational MathematicsStanford UniversityStanfordUSA

Personalised recommendations