• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Constructing Invariants for Hybrid Systems (2004)

Cached

  • Download as a PDF

Download Links

  • [theory.stanford.edu]
  • [www-step.stanford.edu]
  • [react.stanford.edu]
  • [theory.stanford.edu]
  • [www-cs-students.stanford.edu]
  • [www.cs.colorado.edu]
  • [www.cs.colorado.edu]
  • [www-cs-students.stanford.edu]
  • [theory.stanford.edu]
  • [www.cs.colorado.edu]
  • [www-cs-students.stanford.edu]
  • [www.cs.colorado.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sriram Sankaranarayanan , Henny Sipma , Zohar Manna
Venue:IN HYBRID SYSTEMS: COMPUTATION AND CONTROL, LNCS 2993
Citations:59 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Sankaranarayanan04constructinginvariants,
    author = {Sriram Sankaranarayanan and Henny Sipma and Zohar Manna},
    title = {Constructing Invariants for Hybrid Systems},
    booktitle = {IN HYBRID SYSTEMS: COMPUTATION AND CONTROL, LNCS 2993},
    year = {2004},
    pages = {539--554},
    publisher = {Springer-Verlag}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achieved by reducing the invariant generation problem to a constraint solving problem using methods from the theory of ideals over polynomial rings. We extend our previous work on the generation of algebraic invariants for discrete transition systems in order to generate algebraic invariants for hybrid systems. In doing so, we present a new technique to handle consecution across continuous differential equations. The techniques we present allow a trade-off between the complexity of the invariant generation process and the strength of the resulting invariants.

Keyphrases

hybrid system    algebraic invariant    new technique    discrete transition system    polynomial ring    invariant generation process    continuous differential equation    previous work    resulting invariant    invariant generation problem    reachable state   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University