Algorithmic algebraic model checking III: Approximate methods

Venkatesh Mysore, Bud Mishra

Research output: Contribution to journalConference articlepeer-review


We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate how they relate to and extend other existing techniques.

Original languageEnglish (US)
Pages (from-to)61-77
Number of pages17
JournalElectronic Notes in Theoretical Computer Science
Issue number1
StatePublished - Feb 3 2006
EventProceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY 2005) -
Duration: Aug 27 2005Aug 27 2005


  • Model checking
  • Semi-algebraic hybrid systems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Algorithmic algebraic model checking III: Approximate methods'. Together they form a unique fingerprint.

Cite this