Constraints for Continuous Reachability in the Verification of Hybrid Systems
From MaRDI portal
Publication:5302913
DOI10.1007/11856290_18zbMATH Open1156.68476OpenAlexW1573837784MaRDI QIDQ5302913FDOQ5302913
Authors: Stefan Ratschan, Zhikun She 
Publication date: 15 January 2009
Published in: Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11856290_18
Recommendations
Cited In (14)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- Reachability analysis of linear systems with stepwise constant inputs
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Language-Based Abstraction Refinement for Hybrid System Verification
- Tightened reachability constraints for the verification of linear hybrid systems
- Hybrid Systems: Computation and Control
- Using redundant constraints for refinement
- \(\Sigma _{K }\)-constraints for hybrid systems
- Title not available (Why is that?)
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- Applications of MetiTarski in the Verification of Control and Hybrid Systems
- Title not available (Why is that?)
- Synthesizing invariant barrier certificates via difference-of-convex programming
- Constraint-Based Approach for Analysis of Hybrid Systems
Uses Software
This page was built for publication: Constraints for Continuous Reachability in the Verification of Hybrid Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302913)
