Constraint propagation with interval labels
Artificial Intelligence
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
What's decidable about hybrid automata?
Journal of Computer and System Sciences
The essence of constraint propagation
Theoretical Computer Science
Analytic constraint solving and interval arithmetic
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interval arithmetic: From principles to implementation
Journal of the ACM (JACM)
Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
An Algorithm for the Approximative Analysis of Rectangular Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
The d/dt Tool for Verification of Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Hybrid Systems: Computation and Control: 7th International Workshop, Hscc 2004, Philadelphia, Pa, Usa, March 2004: Proceedings (Lecture Notes in Computer Science, 2993)
Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings (Lecture Notes in Computer Science)
Verification of hybrid systems based on counterexample-guided abstraction refinement
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Approximate reachability for linear systems
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
Taylor approximation for hybrid systems
Information and Computation
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid systems: from verification to falsification by combining motion planning and discrete search
Formal Methods in System Design
Applications of MetiTarski in the Verification of Control and Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Tightened reachability constraints for safety verification of linear hybrid systems
ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
Analysis and control of hybrid systems with parameter uncertainty based on interval methods
ACC'09 Proceedings of the 2009 conference on American Control Conference
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Language-based abstraction refinement for hybrid system verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Algebraic analysis on asymptotic stability of continuous dynamical systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Logic and compositional verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Computing a basin of attraction to a target region by solving bilinear semi-definite problems
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Incremental computation of succinct abstractions for hybrid systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Constraints for continuous reachability in the verification of hybrid systems
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Automated machine-checked hybrid system safety proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
From hybrid data-flow languages to hybrid automata: a complete translation
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Algebraic analysis on asymptotic stability of switched hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Reachability analysis of non-linear planar autonomous systems
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis
RP'12 Proceedings of the 6th international conference on Reachability Problems
Dynamically-Driven timed automaton abstractions for proving liveness of continuous systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
An approximation algorithm for box abstraction of transition systems on real state spaces
Formal Methods in System Design
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
FSTPA-I: a formal approach to hazard identification via system theoretic process analysis
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
Discovering polynomial Lyapunov functions for continuous dynamical systems
Journal of Symbolic Computation
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
Hi-index | 0.00 |
This paper deals with the problem of safety verification of nonlinear hybrid systems. We start from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid. We put this method into an abstraction refinement framework and improve it by developing an additional refinement step that employs interval-constraint propagation to add information to the abstraction without introducing new grid elements. Moreover, the resulting method allows switching conditions, initial states, and unsafe states to be described by complex constraints, instead of sets that correspond to grid elements. Nevertheless, the method can be easily implemented, since it is based on a well-defined set of constraints, on which one can run any constraint propagation-based solver. Tests of such an implementation are promising.