The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
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
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Multivariable Feedback Control: Analysis and Design
Multivariable Feedback Control: Analysis and Design
Hybridization methods for the analysis of nonlinear systems
Acta Informatica - Hybrid Systems
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Reachability Analysis of Hybrid Systems Using Support Functions
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Computing Reachable States for Nonlinear Biological Models
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Using redundant constraints for refinement
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Efficient computation of reachable sets of linear time-invariant systems with inputs
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Formal verification of hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Efficient bounded reachability computation for rectangular automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Discretizing affine hybrid automata with uncertainty
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Linear hybrid system falsification through local search
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Formal verification of phase-locked loops using reachability analysis and continuization
Proceedings of the International Conference on Computer-Aided Design
Avoiding geometric intersection operations in reachability analysis of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
From hybrid data-flow languages to hybrid automata: a complete translation
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
CLSE: closed-loop symbolic execution
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Timed relational abstractions for sampled data control systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Approximately bisimilar symbolic models for digital control systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
A box-based distance between regions for guiding the reachability analysis of spaceex
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
HybridSAL relational abstracter
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
A small model theorem for rectangular hybrid automata networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis
RP'12 Proceedings of the 6th international conference on Reachability Problems
Reachability analysis of polynomial systems using linear programming relaxations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Which automata for which safety assessment step of satellite FDIR?
SAFECOMP'12 Proceedings of the 31st international conference on Computer Safety, Reliability, and Security
Limited-information control of hybrid systems via reachable set propagation
Proceedings of the 16th international conference on Hybrid systems: computation and control
Mining requirements from closed-loop control models
Proceedings of the 16th international conference on Hybrid systems: computation and control
Zélus: a synchronous language with ODEs
Proceedings of the 16th international conference on Hybrid systems: computation and control
Flowpipe approximation and clustering in space-time
Proceedings of the 16th international conference on Hybrid systems: computation and control
Certifying the safe design of a virtual fixture control algorithm for a surgical robot
Proceedings of the 16th international conference on Hybrid systems: computation and control
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Verifying information flow properties of hybrid systems
Proceedings of the 2nd ACM international conference on High confidence networked systems
Probabilistic Temporal Logic Falsification of Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Formal verification of phase-locked loops using reachability analysis and continuization
Communications of the ACM
Flow*: an analyzer for non-linear hybrid systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Finite data-rate feedback stabilization of switched and hybrid linear systems
Automatica (Journal of IFAC)
Formal Verification of Analog and Mixed Signal Designs Using SPICE Circuit Simulation Traces
Journal of Electronic Testing: Theory and Applications
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
| Hi-index | 0.02 |
We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to compute an over-approximation of the reachable states. The algorithm improves over previous work by using variable time steps to guarantee a given local error bound. In addition, we propose an improved approximation model, which drastically improves the accuracy of the algorithm. The algorithm is implemented as part of SpaceEx, a new verification platform for hybrid systems, available at spaceex.imag.fr. Experimental results of full fixed-point computations with hybrid systems with more than 100 variables illustrate the scalability of the approach.