Constraints for Continuous Reachability in the Verification of Hybrid Systems
From MaRDI portal
Publication:5302913
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
- scientific article; zbMATH DE number 1956618 (Why is no real title available?)
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- Applications of MetiTarski in the Verification of Control and Hybrid Systems
- scientific article; zbMATH DE number 7361375 (Why is no real title available?)
- Synthesizing invariant barrier certificates via difference-of-convex programming
- Constraint-Based Approach for Analysis of Hybrid Systems
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)
