Constraints for Continuous Reachability in the Verification of Hybrid Systems
From MaRDI portal
Publication:5302913
DOI10.1007/11856290_18zbMath1156.68476OpenAlexW1573837784MaRDI QIDQ5302913
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
Related Items (6)
Reachability analysis of linear systems with stepwise constant inputs ⋮ Synthesizing invariant barrier certificates via difference-of-convex programming ⋮ Language-Based Abstraction Refinement for Hybrid System Verification ⋮ Tightened reachability constraints for the verification of linear hybrid systems ⋮ The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Uses Software
This page was built for publication: Constraints for Continuous Reachability in the Verification of Hybrid Systems
