Cylindrical algebraic decomposition I: the basic algorithm
SIAM Journal on Computing
Theoretical Computer Science
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
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
A Class of Decidable Parametric Hybrid Systems
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Compositional Termination Analysis of Symbolic Forward Analysis
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Co-simulation of Hybrid Systems: Signal-Simulink
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Decidable Model Checking of Probabilistic Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Uniform Reachability Algorithms
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Decidable Controller Synthesis for Classes of Linear Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Reach Set Computations Using Real Quantifier Elimination
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
On the Decidability of the Reachability Problem for Planar Differential Inclusions
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Semi-decidable Synthesis for Triangular Hybrid Systems
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Robust Controller Synthesis for Hybrid Systems Using Modal Logic
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
The d/dt Tool for Verification of Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Journal of Computer and System Sciences
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
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
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
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
Periodically Controlled Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Property Driven Three-Valued Model Checking on Hybrid Automata
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Using redundant constraints for refinement
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Proceedings of the 14th international conference on Hybrid systems: computation and control
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
Journal of Automated Reasoning
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Reachability problems on extended o-minimal hybrid automata
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Taylor approximation for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Generating polynomial invariants for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Interrupt Timed Automata: verification and expressiveness
Formal Methods in System Design
New domains for applied quantifier elimination
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Avoiding geometric intersection operations in reachability analysis of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Invariants for LTI systems with uncertain input
RP'12 Proceedings of the 6th international conference on Reachability Problems
Reachability Analysis of Linear Systems with Stepwise Constant Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.