| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423288 | Electronic Notes in Theoretical Computer Science | 2006 | 17 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
