Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
From MaRDI portal
Publication:5458327
DOI10.1007/978-3-540-78800-3_14zbMATH Open1134.68419OpenAlexW1497013959MaRDI QIDQ5458327FDOQ5458327
Authors: Sriram Sankaranarayanan, Thao Dang, Franjo Ivančić 
Publication date: 11 April 2008
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_14
Recommendations
Cites Work
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- Hybrid Systems: Computation and Control
- Semidefinite programming relaxations for semialgebraic problems
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Newton: Constraint programming over nonlinear constraints
- Title not available (Why is that?)
- Computer Aided Verification
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Static Analysis
- Counterexample-guided predicate abstraction of hybrid systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- A Policy Iteration Technique for Time Elapse over Template Polyhedra
Cited In (23)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
- Polyhedral flows in hybrid automata
- Discretizing affine hybrid automata with uncertainty
- Template-based unbounded time verification of affine hybrid automata
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
- Template polyhedra and bilinear optimization
- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Generating invariants for non-linear hybrid systems
- \(\epsilon\)-semantics computations on biological systems
- Taylor approximation for hybrid systems
- Verification of Hybrid Systems
- A Policy Iteration Technique for Time Elapse over Template Polyhedra
- Exact join detection for convex polyhedra and other numerical abstractions
- Quantifier-free encoding of invariants for hybrid systems
- Counterexample-Guided Refinement of Template Polyhedra
- Hybrid Tools for Hybrid Systems – Proving Stability and Safety at Once
- Symbolic analysis of linear hybrid automata -- 25 years later
- On bisimilarity for polyhedral models and \texttt{SLCS}
- Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis
- Synthesizing switching controllers for hybrid systems by generating invariants
- Geometric Model Checking of Continuous Space
- Reachability computation for polynomial dynamical systems
Uses Software
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)
