Journal of Symbolic Computation
Theoretical Computer Science
Counting connected components of a semialgebraic set in subexponential time
Computational Complexity
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The d/dt Tool for Verification of Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Efficient solving of quantified inequality constraints over the real numbers
ACM Transactions on Computational Logic (TOCL)
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
Taylor approximation for hybrid systems
Information and Computation
Algorithmic Algebraic Model Checking III: Approximate Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
Progress on reachability analysis of hybrid systems using predicate abstraction
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Automated symbolic reachability analysis: with application to delta-notch signaling automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Algorithmic algebraic model checking i: challenges from systems biology
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
From synchronous programs to symbolic representations of hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the reachability problem on semi-algebraic hybrid automata. In particular, we deal with the effective cost that has to be afforded to solve reachability through first-order satisfiability. The analysis we perform with some existing tools shows that even simple examples cannot be efficiently solved. We need approximations to reduce the number of variables in our formulae: this is the main source of time computation growth. We study standard approximation methods based on Taylor polynomials and ad-hoc strategies to solve the problem and we show their effectiveness on the repressilator case study.