Tightened reachability constraints for the verification of linear hybrid systems

DOI10.1016/J.NAHS.2008.09.013MaRDI QIDQ1026401zbMATH OpenOpenAlexFDO

Authors Zhikun She, Zhiming Zheng

Publication date 24 June 2009

Published in Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.nahs.2008.09.013

zbMATH Keywords

hybrid systemssafety verificationreachability constraints

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Eigenvalue problems (93B60) Linear systems in control theory (93C05)

Recommendations

• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Hybrid Systems: Computation and Control
• Using redundant constraints for refinement
• scientific article; zbMATH DE number 1956651
• Abstractions of hybrid systems for verification

Cites work

• scientific article; zbMATH DE number 1950444 (Why is no real title available?)
• scientific article; zbMATH DE number 1956651 (Why is no real title available?)
• scientific article; zbMATH DE number 1794361 (Why is no real title available?)
• Applying interval arithmetic to real, integer, and boolean constraints
• Constraint propagation with interval labels
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Efficient solving of quantified inequality constraints over the real numbers
• Hybrid Systems: Computation and Control
• Validated solutions of initial value problems for ordinary differential equations

Cited in

(10)

• Time-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Span-reachability and observability of bilinear hybrid systems
• Fully automated verification of linear time-invariant systems against signal temporal logic specifications via reachability analysis
• Hybrid Systems: Computation and Control
• Using redundant constraints for refinement
• Rigorous constraint satisfaction for sampled linear systems
• Discovering polynomial Lyapunov functions for continuous dynamical systems
• Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
• A semi-algebraic approach for asymptotic stability analysis

Describes a project that uses

Uses Software

• HSolver
• Benchmarks
• RSOLVER

This page was built for publication: Tightened reachability constraints for the verification of linear hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026401)