The computational complexity of simultaneous diophantine approximation problems
SIAM Journal on Computing
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
General hybrid dynamical systems: modeling, analysis, and control
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Technique for Invariant Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Generating all polynomial invariants in simple loops
Journal of Symbolic Computation
Constructing invariants for hybrid systems
Formal Methods in System Design
DISCOVERER: a tool for solving semi-algebraic systems
ACM Communications in Computer Algebra
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Differential Dynamic Logic for Hybrid Systems
Journal of Automated Reasoning
Differential Dynamic Logic for Verifying Parametric Hybrid Systems
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Constraint-Based Approach for Analysis of Hybrid Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Morphisms for Non-trivial Non-linear Invariant Generation for Algebraic Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Computing differential invariants of hybrid systems as fixedpoints
Formal Methods in System Design
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
FM '09 Proceedings of the 2nd World Congress on Formal Methods
European Train Control System: A Case Study in Formal Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Differential-algebraic Dynamic Logic for Differential-algebraic Programs
Journal of Logic and Computation
Automatic invariant generation for hybrid systems using ideal fixed points
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
The image computation problem in hybrid systems model checking
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
A sound and complete proof rule for region stability of hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Reachability analysis of nonlinear systems using conservative approximation
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Reasoning algebraically about P-solvable loops
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Generating polynomial invariants with DISCOVERER and QEPCAD
Formal methods and hybrid real-time systems
Journal of Symbolic Computation
Fixed point iteration for computing the time elapse operator
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Generating polynomial invariants for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Hi-index | 0.00 |
In this paper we discuss how to generate inequality invariants for continuous dynamical systems involved in hybrid systems. A hybrid symbolic-numeric algorithm is presented to compute inequality invariants of the given systems, by transforming this problem into a parameterized polynomial optimization problem. A numerical inequality invariant of the given system can be obtained by applying polynomial Sum-of-Squares (SOS) relaxation via Semidefinite Programming (SDP). And a method based on Gauss-Newton refinement is deployed to obtain candidates of polynomials with rational coefficients, and finally we certify that this polynomial exactly satisfies the conditions of invariants, by use of SOS representation of polynomials with rational coefficients. Several examples are given to show that our algorithm can successfully yield inequality invariants with rational coefficients.