Algorithmic Algebraic Model Checking III: Approximate Methods

Authors:
Venkatesh Mysore;Bud Mishra
Affiliations:
Computer Science Department, Courant Institute, New York University, New York, USA;Departments of Computer Science and Mathematics, Courant Institute, Department of Cell Biology, School of Medicine, New York University, New York, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 2
Cited 7

Monotonic hybrid systems

Journal of Computer and System Sciences
Algorithmic algebraic model checking II: decidability of semi-algebraic model checking and its applications to systems biology

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis

Taylor approximation for hybrid systems

Information and Computation
Hybrid Automata in Systems Biology: How Far Can We Go?

Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid automata, reachability, and Systems Biology

Theoretical Computer Science
Algebraic systems biology: theses and hypotheses

AB'07 Proceedings of the 2nd international conference on Algebraic biology
Algorithmic algebraic model checking IV: characterization of metabolic networks

AB'07 Proceedings of the 2nd international conference on Algebraic biology
Low dimensional hybrid systems - decidable, undecidable, don't know

Information and Computation
Refining the undecidability frontier of hybrid automata

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.