Proving properties of continuous systems: qualitative simulation and temporal logic
Artificial Intelligence
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Hybrid Systems I
Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Using Abstractions for the Verification of Linear Hybrid Systems
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Modular Specification of Hybrid Systems in CHARON
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Monitoring, prediction, and fault isolation in dynamic physical systems
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Reachability Analysis of Delta-NotchLateral Inhibition Using Predicate Abstraction
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Overapproximating Reachable Sets by Hamilton-Jacobi Projections
Journal of Scientific Computing
Qualitative simulation and related approaches for the analysis of dynamic systems
The Knowledge Engineering Review
Towards formal verification of analog designs
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstractions for hybrid systems
Formal Methods in System Design
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Dealing with Nondeterminism in Symbolic Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Inclusion dynamics hybrid automata
Information and Computation
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Property Driven Three-Valued Model Checking on Hybrid Automata
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Comparing forward and backward reachability as tools for safety analysis
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Qualitative analysis of nonlinear biochemical networks with piecewise-affine functions
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
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
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Progress on reachability analysis of hybrid systems using predicate abstraction
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
A Hoare logic for single-input single-output continuous-time control systems
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
Approximate reachability for linear systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Algorithmic algebraic model checking IV: characterization of metabolic networks
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Symbolic reachability analysis of lazy linear hybrid automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Theoretical Computer Science
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A hierarchical approach for the synthesis of stabilizing controllers for hybrid systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Approximate reachability computation for polynomial systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A fully automated framework for control of linear systems from LTL specifications
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th 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
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Refining abstractions of hybrid systems using counterexample fragments
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Reachability of uncertain linear systems using zonotopes
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
An algebraic approach for the unsatisfiability of nonlinear constraints
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Automatic verification of hybrid systems with large discrete state space
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Template-Based unbounded time verification of affine hybrid automata
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
One-shot computation of reachable sets for differential games
Proceedings of the 16th international conference on Hybrid systems: computation and control
Formal analysis of steady state errors in feedback control systems using HOL-light
Proceedings of the Conference on Design, Automation and Test in Europe
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Hi-index | 0.00 |
We present a technique based on the use of the quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. Our technique works on linear and non-linear polynomial hybrid systems, that is, the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. We have a prototype tool in the SAL environment [13] which is built over the theorem prover PVS [19]. The technique promises to scale well to large and complex hybrid systems.