Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
From MaRDI portal
Publication:5458327
Recommendations
Cites work
- scientific article; zbMATH DE number 3610766 (Why is no real title available?)
- scientific article; zbMATH DE number 1303061 (Why is no real title available?)
- scientific article; zbMATH DE number 1956651 (Why is no real title available?)
- scientific article; zbMATH DE number 1738295 (Why is no real title available?)
- scientific article; zbMATH DE number 1905118 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1444352 (Why is no real title available?)
- A Policy Iteration Technique for Time Elapse over Template Polyhedra
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- Computer Aided Verification
- Counterexample-guided predicate abstraction of hybrid systems
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Newton: Constraint programming over nonlinear constraints
- Semidefinite programming relaxations for semialgebraic problems
- Static Analysis
Cited in
(25)- Generating invariants for non-linear hybrid systems
- Hybrid tools for hybrid systems -- proving stability and safety at once
- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
- Eliminating spurious transitions in reachability with support functions
- Symbolic analysis of linear hybrid automata -- 25 years later
- A Policy Iteration Technique for Time Elapse over Template Polyhedra
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Template-based unbounded time verification of affine hybrid automata
- Taylor approximation for hybrid systems
- Exact join detection for convex polyhedra and other numerical abstractions
- \(\epsilon\)-semantics computations on biological systems
- Verification of Hybrid Systems
- On bisimilarity for polyhedral models and \texttt{SLCS}
- Synthesizing switching controllers for hybrid systems by generating invariants
- Time-triggered conversion of guards for reachability analysis of hybrid automata
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
- Template polyhedra and bilinear optimization
- Discretizing affine hybrid automata with uncertainty
- Geometric Model Checking of Continuous Space
- Reachability computation for polynomial dynamical systems
- Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis
- Polyhedral flows in hybrid automata
- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Quantifier-free encoding of invariants for hybrid systems
- Counterexample-Guided Refinement of Template Polyhedra
This page was built for publication: Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458327)
