Symbolic analysis of linear hybrid automata -- 25 years later

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The algorithmic analysis of hybrid systems
Some ways to reduce the space dimension in polyhedra computations
The octagon abstract domain
Reachability analysis of linear systems using support functions
What's decidable about hybrid automata?
HyTech: A model checker for hybrid systems
Continuous-time models for system design and analysis
PPLite: zero-overhead encoding of NNC polyhedra
Hybridization based CEGAR for hybrid automata with affine dynamics
Not necessarily closed convex polyhedra and the double description method
Template-Based Unbounded Time Verification of Affine Hybrid Automata
Eliminating spurious transitions in reachability with support functions
Counterexample-Guided Refinement of Template Polyhedra
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
Verification and Control of Hybrid Systems
Fourier's Method of Linear Programming and Its Dual
Algorithmic analysis of nonlinear hybrid systems
Fast polyhedra abstract domain
Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
Convex Analysis
Algorithm for discovering the set of all the solutions of a linear programming problem
Hybrid Systems: Computation and Control
Verification, Model Checking, and Abstract Interpretation
Verification, Model Checking, and Abstract Interpretation
Space-time interpolants
An efficient abstract domain for not necessarily closed polyhedra
A direct encoding for NNC polyhedra

This page was built for publication: Symbolic analysis of linear hybrid automata -- 25 years later